Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Beraldi, Patrizia & Ruszczynski, Andrzej, 2005. "Beam search heuristic to solve stochastic integer problems under probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 167(1), pages 35-47, November.
- Sabuncuoglu, I. & Bayiz, M., 2000. "Analysis of reactive scheduling problems in a job shop environment," European Journal of Operational Research, Elsevier, vol. 126(3), pages 567-586, November.
- Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
- McMullen, P.R. & Tarasewich, Peter, 2005. "A beam search heuristic method for mixed-model scheduling with setups," International Journal of Production Economics, Elsevier, vol. 96(2), pages 273-283, May.
- 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.
- 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.
- Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
- Lim, A. & Rodrigues, B. & Zhang, X., 2006. "Scheduling sports competitions at multiple venues--Revisited," European Journal of Operational Research, Elsevier, vol. 175(1), pages 171-186, November.
- Bautista, J. & Companys, R. & Corominas, A., 1996. "Heuristics and exact algorithms for solving the Monden problem," European Journal of Operational Research, Elsevier, vol. 88(1), pages 101-113, January.
- 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.
- Zhou, Xuesong & Zhong, Ming, 2005. "Bicriteria train scheduling for high-speed passenger railroad planning applications," European Journal of Operational Research, Elsevier, vol. 167(3), pages 752-771, December.
- Yow-yuh Leu & Philip Huang & Roberta Russell, 1997. "Using beam search techniques for sequencing mixed-model assembly lines," Annals of Operations Research, Springer, vol. 70(0), pages 379-397, April.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
- Nils Boysen & Florian Jaehn & Erwin Pesch, 2011. "Scheduling Freight Trains in Rail-Rail Transshipment Yards," Transportation Science, INFORMS, vol. 45(2), pages 199-211, May.
- Zhang, Sicheng & Li, Xiang & Zhang, Bowen & Wang, Shouyang, 2020. "Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system," European Journal of Operational Research, Elsevier, vol. 283(2), pages 441-460.
- Kress, Dominik & Dornseifer, Jan & Jaehn, Florian, 2019. "An exact solution approach for scheduling cooperative gantry cranes," European Journal of Operational Research, Elsevier, vol. 273(1), pages 82-101.
- Portoleau, Tom & Artigues, Christian & Guillaume, Romain, 2024. "Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration," European Journal of Operational Research, Elsevier, vol. 312(2), pages 525-540.
- H. Mosadegh & S.M.T. Fatemi Ghomi & G.A. Süer, 2017. "Heuristic approaches for mixed-model sequencing problem with stochastic processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2857-2880, 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.
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, 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.
- 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 & Fliedner, Malte & Scholl, Armin, 2009.
"Sequencing mixed-model assembly lines: Survey, classification and model critique,"
European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
- Nils Boysen & Malte Fliedner & Armin Scholl, 2007. "Sequencing mixed-model assembly lines: Survey, classification and model critique," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 02/2007, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- 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.
- 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.
- 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.
- 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.
- Ding, Fong-Yuen & Zhu, Jin & Sun, Hui, 2006. "Comparing two weighted approaches for sequencing mixed-model assembly lines with multiple objectives," International Journal of Production Economics, Elsevier, vol. 102(1), pages 108-131, July.
- 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.
- 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.
- Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
- 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.
- 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.
- 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.
- Chen, Jiang Hang & Lee, Der-Horng & Cao, Jin Xin, 2011. "Heuristics for quay crane scheduling at indented berth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1005-1020.
- 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.
- Joaquín Bautista & Jordi Pereira & Belarmino Adenso-Díaz, 2008. "A Beam Search approach for the optimization version of the Car Sequencing Problem," Annals of Operations Research, Springer, vol. 159(1), pages 233-244, March.
- Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
- Xueqiao Yu & Maoxiang Lang & Wenhui Zhang & Shiqi Li & Mingyue Zhang & Xiao Yu, 2019. "An Empirical Study on the Comprehensive Optimization Method of a Train Diagram of the China High Speed Railway Express," Sustainability, MDPI, vol. 11(7), pages 1-30, April.
Corrections
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:eee:ejores:v:186:y:2008:i:3:p:915-930. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.