Heuristic-Tabu algorithm for hybrid flowshop scheduling with limited waiting time

Proceedings of the 2008 International Symposium on Computational Intelligence and Design, ISCID 2008

Volumn 2, Issue , 2008, Pages 233-237

  Liu, Siyi ^a   Cui, Jianshuang ^a   Li, Yan ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b BAOSTEEL RESEARCH INSTITUTE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; SCHEDULING; TABU SEARCH;

COMPUTATIONAL RESULTS; FINITE PLANNING HORIZON; HYBRID FLOW SHOP SCHEDULING; MAKESPAN; SIMPLE TABU SEARCH; TABU ALGORITHM; UPPER BOUND; WAITING-TIME;

JOB SHOP SCHEDULING;

EID: 61349199494     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscid.2008.161     Document Type: Conference Paper

References (15)

1. A. Vignier, J. C. Billaut, and C. Proust, "Les problemes d'ordonnancement de type flow-shop hybride: Etat de l'art," RAIRO Recherche Operationnelle, vol. 33, p. 117, 1999.
2. J. A. Hoogeveen, J. K. Lenstra, and B. Veltman, "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, vol. 89, p. 172, 1996.
3. R. Linn and Z. Wei, "Hybrid flow shop scheduling: a survey," Computers & Industrial Engineering, vol. 37, p. 57, 1999.
4. O. Moursli and Y. Pochet, "Branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, vol. 64, p. 113, 2000.
5. V. Botta-Genoulaz, "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, vol. 64, p. 101, 2000.
6. L.-H. Su, "A hybrid two-stage flowshop with limited waiting time constraints," Computers & Industrial Engineering, vol. 44, p. 409, 2003.
7. C. Jen-Shiang and Y. Jin-Shan, "Model formulations for the machine scheduling problem with limited waiting time constraints," Journal of Information & Optimization Sciences, vol. 27, p. 225, 2006.
8. X. Wenxun Wenxun, W. Zhenbo, and B. Fengshan, "No-wait flexible flowshop scheduling with no-idle machines," Operations Research Letters, vol. 33, p. 609, 2005.
9. M. A. Kubzin and V. A. Strusevich, "Two-Machine flow shop no-wait scheduling with a nonavailability interval," Naval Research Logistics, vol. 51, p. 613, 2004.
10. C. J. Schuster and J. M. Framinan, "Approximative procedures for no-wait job shop scheduling," Operations Research Letters, vol. 31, p. 308, 2003.
11. Z. Jin, Z. Yang, and T. Ito, "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, vol. 100, pp. 322-334, 2006.
12. M. Nawaz, E. E. Enscore, Jr., and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, vol. 11, p. 91, 1983.
13. R. Ruiz and C. Maroto, "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, vol. 165, p. 479, 2005.
14. J. M. Framinan, R. Leisten, and R. Ruiz-Usano, "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, vol. 141, p. 559, 2002.
15. D. L. Santos, J. L. Hunsucker, and D. E. Deal, "Global lower bounds for flow shops with multiple processors," European Journal of Operational Research, vol. 80, p. 112, 1995.