A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan

International Journal of Advanced Manufacturing Technology

Volumn 53, Issue 5-8, 2011, Pages 761-776

  Wang, Hui Mei ^a   Chou, Fuh Der ^b   Wu, Ful Chiang ^a  

^a VANUNG UNIVERSITY   (Taiwan)

^b CHING YUN UNIVERSITY   (Taiwan)

Author keywords

Hybrid flow shop; Multiprocessor tasks; Scheduling; Simulated annealing

Indexed keywords

BENCH-MARK PROBLEMS; FLOW-SHOPS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; LIST-SCHEDULING; MAKESPAN; MAKESPAN CRITERION; META-HEURISTIC APPROACH; MULTIPROCESSOR TASKS; NONDETERMINISTIC POLYNOMIAL; OBJECTIVE FUNCTION VALUES; PROCESSING TIME; SIMULATED ANNEALING ALGORITHMS;

HEURISTIC METHODS; MACHINE SHOP PRACTICE; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 79953039544     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2868-z     Document Type: Article

References (31)

1. S Johnson 1954 Optimal two and three stage production schedules with set-up times included Nav Res Logist 1 61 68 10.1002/nav.3800010110
2. C-Y Lee GL Vairaktarakis 1994 Minimizing makespan in hybrid flowshops Oper Res Lett 16 149 158 1306218 0812.90066 10.1016/0167-6377(94)90026-4
3. H Haouari R M'Hallah 1997 Heuristic algorithms for the two-stage hybrid flowshop problem Oper Res Lett 21 43 53 1471669 0885.90055 10.1016/S0167- 6377(97)00004-7
4. F Riane A Artiba SE Elmaghraby 1998 A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan Eur J Oper Res 109 321 329 0937.90035 10.1016/S0377-2217(98)00060-5 (Pubitemid 128417835)
5. R Linn W Zhang 1999 Hybrid flow shop schedule: a survey Comput Ind Eng 37 57 61 10.1016/S0360-8352(99)00023-6
6. MF Ercan Y-F Fung C Oǧuz 2001 Scheduling image processing tasks in a multilayer system Comput Electr Eng 27 429 443 1015.68023 10.1016/S0045-7906(00)00036-7 (Pubitemid 32935087)
7. MF Ercan C Oǧuz 2005 Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks Comput Electr Eng 31 537 555 1093.68009 10.1016/j.compeleceng.2005.09.004 (Pubitemid 43227261)
8. C Oǧuz MF Ercan TCE Cheng YF Fung 2003 Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop Eur J Oper Res 149 390 403 1059.90072 10.1016/S0377-2217(02)00766-X
9. H Krawczyk M Kubale 1985 An approximation algorithm for diagnostic test scheduling in multicomputer systems IEEE T Comput 34 869 872 10.1109/TC.1985.1676647 (Pubitemid 16494343)
10. Y Guan WQ Xiao RK Cheung CL Li 2002 A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis Oper Res Lett 30 343 350 1932883 1010.90026 10.1016/S0167-6377(02)00147-5 (Pubitemid 35167682)
11. RL Graham EL Lawler JK Lenstra AHG Rinnooy Kan 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Ann Discret Math 5 287 326 558574 0411.90044 10.1016/S0167-5060(08)70356-X
12. Oǧuz C, Qi XT, Fung YF (1998) Scheduling multiprocessor tasks in a hybrid flow-shop using a genetic algorithm. Working Paper No. 11/97-8, Faculty of Business and Information System, The Hong Kong Polytechnic University, Hong Kong
13. C Oǧuz Y Zinder VH Do A Janiak M Lichtenstein 2004 Hybrid flow-shop scheduling problems with multiprocessor task systems Eur J Oper Res 152 115 131 1044.90036 10.1016/S0377-2217(02)00644-6
14. Ying K-C and Lin S-W 2009 Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic Int J Prod Res 47 3525 3538 10.1080/00207540701871085
15. C Oǧuz MF Ercan 2005 A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks J Sched 8 323 351 2149893 1123.90314 10.1007/s10951-005-1640-y (Pubitemid 40878783)
16. Ying K-C and Lin S-W 2006 Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach Int J Prod Res 44 3161 3177 10.1080/00207540500536939 (Pubitemid 43898318)
17. F Sivrikaya-Serifoǧlu G Ulusoy 2004 Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach J Oper Res Soc 55 504 512 1070.90046 10.1057/palgrave.jors.2601716
18. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, 1942-1948
19. Tseng C-T and Liao C-J 2008 A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks Int J Prod Res 46 4655 4670 10.1080/00207540701294627
20. Ercan MF (2008) A hybrid particle swarm optimization approach for scheduling flow-shops with multiprocessor tasks. In: 2008 International Conference on Information Science and Security
21. A Jouglet C Oǧuz M Sevaux 2009 Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search J Math Model Algor 8 271 292 1184.68127 10.1007/s10852-008-9101-1
22. S Kirkpatrick CD Gelatt MP Vecchi 1983 Optimization by simulated annealing Science 220 671 680 702485 10.1126/science.220.4598.671
23. PJM Van Laarhoven EHL Aarts JK Lenstra 1992 Job shop scheduling by simulated annealing Oper Res 40 113 125 1152731 0751.90039 10.1287/opre.40.1.113
24. M Mathirajan V Bhargav V Ramachandra 2010 Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates Int J Adv Manuf Tech 48 1133 1148 10.1007/s00170-009-2342-y
25. P Damodaran PY Chang 2008 Heuristics to minimize makespan of parallel batch processing machines Int J Adv Manuf Tech 37 1005 1013 10.1007/s00170-007- 1042-8 (Pubitemid 351768708)
26. SH Zegoridi K Itoh T Enkawa 1995 Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge Eur J Oper Res 85 515 531 10.1016/0377-2217(94)00021-4
27. L Dipak UK Chakraborty 2009 An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling Int J Adv Manuf Tech 44 559 569 10.1007/s00170-008-1845-2
28. Sivrikaya SF, Tiryaki IU (2002) Multiprocessor task scheduling in multistage hybrid flow-shops: a simulated annealing approach. In: Proceedings of the 2nd International Conference on Responsive Manufacturing, Gaziantep, Turkey, pp 270-274
29. FD Chou 2009 An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem Expert Syst Appl 36 3857 3865 10.1016/j.eswa.2008.02.040
30. Henderson D, Jacobson SH, Johnson AW (2003) The theory and practice of simulated annealing. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 219-249
31. Dongarra JJ (2009) Performance of various computers using standard linear equations software. Report CS-89-85. http://www.netlib.org/benchmark/ performance.pdf