Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Jorge M. S. Valente, 2006. "Heuristics for the single machine scheduling problem with early and quadratic tardy penalties," FEP Working Papers 234, Universidade do Porto, Faculdade de Economia do Porto.
- Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
- Ghirardi, M. & Potts, C. N., 2005. "Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach," European Journal of Operational Research, Elsevier, vol. 165(2), pages 457-467, September.
- Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
- F Della Croce & V T'kindt, 2002. "A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1275-1280, November.
- Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
- John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
- Su, Ling-Huey & Chang, Pei-Chann, 1998. "A heuristic to minimize a quadratic function of job lateness on a single machine," International Journal of Production Economics, Elsevier, vol. 55(2), pages 169-175, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Jorge M. S. Valente & José Fernando Gonçalves, 2008. "A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties," FEP Working Papers 264, Universidade do Porto, Faculdade de Economia do Porto.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- J M S Valente, 2010. "Beam search heuristics for quadratic earliness and tardiness scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 620-631, April.
- Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
- Sabuncuoglu, Ihsan & Gocgun, Yasin & Erel, Erdal, 2008. "Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling," European Journal of Operational Research, Elsevier, vol. 186(3), pages 915-930, May.
- Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
- Jorge M. S. Valente, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, Universidade do Porto, Faculdade de Economia do Porto.
- Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.
- Jorge M. S. Valente & Maria R. A. Moreira, 2008. "Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties," FEP Working Papers 286, Universidade do Porto, Faculdade de Economia do Porto.
- Bennell, J.A. & Cabo, M. & Martínez-Sykora, A., 2018. "A beam search approach to solve the convex irregular bin packing problem with guillotine guts," European Journal of Operational Research, Elsevier, vol. 270(1), pages 89-102.
- Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
- Billaut, Jean-Charles & Della Croce, Federico & Grosso, Andrea, 2015. "A single machine scheduling problem with two-dimensional vector packing constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 75-81.
- Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
- Jorge M. S. Valente & Rui A. F. S. Alves, 2004. "Beam search algorithms for the early/tardy scheduling problem with release dates," FEP Working Papers 143, Universidade do Porto, Faculdade de Economia do Porto.
- Parreño, F. & Alonso, M.T. & Alvarez-Valdes, R., 2020. "Solving a large cutting problem in the glass manufacturing industry," European Journal of Operational Research, Elsevier, vol. 287(1), pages 378-388.
- Jorge M. S. Valente & Rui A. F. S. Alves, 2004. "Filtered and Recovering beam search algorithms for the early/tardy scheduling problem with no idle time," FEP Working Papers 142, Universidade do Porto, Faculdade de Economia do Porto.
- Gurel, Sinan & Akturk, M. Selim, 2007. "Optimal allocation and processing time decisions on non-identical parallel CNC machines: [epsilon]-constraint approach," European Journal of Operational Research, Elsevier, vol. 183(2), pages 591-607, December.
- Jorge M. S. Valente, 2005. "Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups," FEP Working Papers 186, Universidade do Porto, Faculdade de Economia do Porto.
- Schaller, Jeffrey & Valente, Jorge M.S., 2020. "Minimizing total earliness and tardiness in a nowait flow shop," International Journal of Production Economics, Elsevier, vol. 224(C).
- David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
- Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
- Xin Jia Jiang & Yanhua Xu & Chenhao Zhou & Ek Peng Chew & Loo Hay Lee, 2018. "Frame Trolley Dispatching Algorithm for the Frame Bridge Based Automated Container Terminal," Transportation Science, INFORMS, vol. 52(3), pages 722-737, June.
More about this item
Keywords
scheduling; single machine; linear earliness; quadratic tardiness; beam search; heuristics;All these keywords.
NEP fields
This paper has been announced in the following NEP Reports:- NEP-CMP-2007-10-27 (Computational Economics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:por:fepwps:250. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/fepuppt.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.