Beam search algorithms for the early/tardy scheduling problem with release dates
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- 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.
- George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
- Jorge M. S. Valente & Rui A. F. S. Alves, 2003. "An Exact Approach to Early/Tardy Scheduling with Release Dates," FEP Working Papers 129, 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.- 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.
- 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.
- Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.
- 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.
- 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.
- 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.
- Cristina Barbot, 2004. "Low cost carriers, secondary airports and State aid: an economic assessment of the Charleroi affair," FEP Working Papers 159, Universidade do Porto, Faculdade de Economia do Porto.
- Rosa Forte, 2004. "The relationship between foreign direct investment and international trade. Substitution or complementarity? A survey," FEP Working Papers 140, Universidade do Porto, Faculdade de Economia do Porto.
- 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.
- E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
- 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.
- Jouglet, Antoine & Savourey, David & Carlier, Jacques & Baptiste, Philippe, 2008. "Dominance-based heuristics for one-machine total cost scheduling problems," European Journal of Operational Research, Elsevier, vol. 184(3), pages 879-899, February.
- Ana Paula Delgado & Isabel Maria Godinho, 2004. "The evolution of city size distribution in Portugal: 1864-2001," FEP Working Papers 151, Universidade do Porto, Faculdade de Economia do Porto.
- J M S Valente & R A F S Alves, 2005. "Improved lower bounds for the early/tardy scheduling problem with no idle time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 604-612, May.
- Chen, Shih-Hsin & Chen, Min-Chih, 2013. "Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems," International Journal of Production Economics, Elsevier, vol. 141(1), pages 24-33.
- 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.
- Boysen, Nils & Bock, Stefan, 2011.
"Scheduling just-in-time part supply for mixed-model assembly lines,"
European Journal of Operational Research, Elsevier, vol. 211(1), pages 15-25, May.
- Nils Boysen & Stefan Bock, 2010. "Scheduling Just-in-Time Part Supply for Mixed-Model Assembly Lines," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 01/2010, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- Mário Rui Silva & Hermano Rodrigues, 2004.
"Competitiveness and Public-Private Partnerships: Towards a More Decentralised Policy,"
ERSA conference papers
ersa04p299, European Regional Science Association.
- Mário Rui Silva & Hermano Rodrigues, 2005. "Competitiveness and Public-Private Partnerships: Towards a More Decentralised Policy," FEP Working Papers 171, Universidade do Porto, Faculdade de Economia do Porto.
- 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.
- R-H Huang & C-L Yang, 2009. "An algorithm for minimizing flow time and maximum earliness on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 873-877, June.
More about this item
Keywords
scheduling; early/tardy; beam search; heuristics;All these keywords.
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:143. 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.