An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 44, Issue 5-6, 2009, Pages 559-569

  Laha, Dipak ^a   Chakraborty, Uday Kumar ^b  

^a JADAVPUR UNIVERSITY   (India)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Flow shop; Heuristics; Makespan; Optimization; Scheduling; Simulated annealing

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATIONAL EXPERIMENT; CONSTRUCTIVE HEURISTIC; FLOW SHOP; HEURISTICS; HYBRID HEURISTICS; MAKESPAN; MAKESPAN MINIMIZATION; PERMUTATION FLOW-SHOP SCHEDULING; SOLUTION QUALITY; STATE-OF-THE-ART APPROACH;

ANNEALING; HEURISTIC METHODS; MACHINE SHOP PRACTICE; SCHEDULING; STATISTICAL TESTS;

SIMULATED ANNEALING;

EID: 68949201218     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1845-2     Document Type: Article

References (63)

1. J Heller 1960 Some numerical experiments for an M∈×∈J flow shop and its decision-theoretical aspects Oper Res 8 178 184
2. HG Campbell RA Dudek ML Smith 1970 A heuristic algorithm for the n-job, m-machine scheduling problem Manage Sci 16 630 637
3. I Adiri D Pohoryles 1982 Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times Nav Res Logistics 29 495 504
4. M Nawaz E Enscore I Ham 1983 A heuristic algorithm for the m- machine, n-job flowshop sequencing problem Omega 11 91 95
5. NG Hall C Sriskandarajah 1996 A survey of machine scheduling problems with blocking and no-wait in process Oper Res 44 510 525
6. E Bertolissi 2000 Heuristic algorithm for scheduling in the no-wait flow-shop J Mater Process Technol 107 459 465
7. A Lim B Rodrigues C Wang 2006 Two-machine flow shop problems with a single server J Sched 9 515 543
8. A Kumar A Prakash R Shankar MK Tiwari 2006 Psycho-clonal algorithm based approach to solve continuous flowshop scheduling problem Expert Syst Appl 31 504 514
9. R Ruiz A Allahverdi 2007 No-wait flowshop with separate setup times to minimize maximum lateness Int J Adv Manuf Technol 35 551 565
10. UK Chakraborty D Laha 2007 An improved heuristic for permutation flowshop scheduling Int J Inf Commun Technol 1 89 97
11. Laha D, Chakraborty UK (2008) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Int J Adv Manuf Technol. doi: 10.1007/s00170-008-1454-0
12. DG Dannenbring 1977 An evaluation of flow-shop sequencing heuristic Manage Sci 23 1174 1182
13. JR King AS Spachis 1980 Heuristics for flowshop scheduling Int J Prod Res 18 343 357
14. A Fink S Voß 2003 Solving the continuous flow-shop scheduling problem by metaheuristics Eur J Oper Res 151 400 414
15. E Taillard 1990 Some efficient heuristic methods for the flow shop sequencing problem Eur J Oper Res 47 65 74
16. A Guinet M Legrand 1998 Reduction of job-shop problems to flow-shop problems with precedence constraints Eur J Oper Res 109 96 110
17. L Wang D Zheng 2001 An effective hybrid optimization strategy for job-shop scheduling problems Comput Oper Res 28 585 596
18. WM Cheung H Zhou 2001 Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times Ann Oper Res 107 65 81 (Pubitemid 33634450)
19. CJ Schuster JM Framinan 2003 Approximate procedures for no-wait job shop scheduling Oper Res Lett 31 308 318
20. MR Garey DS Jonson R Sethi 1976 The complexity of flowshop and job shop scheduling Math Oper Res 1 117 129
21. T Gonzalez S Sahni 1978 Flow shop and job shop scheduling: complexity and approximation Oper Res 26 36 52
22. Pinedo M (2002) Scheduling: theory, algorithms and systems, 2nd edn. Prentice-Hall, Englewood Cliffs
23. Chakraborty UK (ed) (2009) Computational intelligence in flow shop and job shop scheduling. Springer, Berlin (in press)
24. Michalewicz Z (1996) Genetic algorithms∈+∈data structures∈=∈evolution programs. Springer, Berlin
25. Aarts E, Korst J (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Wiley, Chichester
26. SA Mansouri 2006 A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain Comput Ind Eng 50 105 119
27. M Dorigo V Maniezzo A Colorni 1996 The ant system: optimization by a colony of cooperating agents IEEE Trans Syst Man Cybern Part B 26 29 41
28. R Storn KV Price 1997 Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces J Glob Optim 2 341 359
29. Chakraborty UK (ed) (2008) Advances in differential evolution. Springer, Berlin
30. B Qian L Wang H De-Xian X Wang 2008 Scheduling multi-objective job shops using a memetic algorithm based on differential evolution Int J Adv Manuf Technol 35 1014 1027
31. A Allahverdi FS Al-Anzi 2008 The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time Int J Adv Manuf Technol 37 166 177
32. Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Academic, San Diego
33. C-J Liao C-T Tseng P Luarn 2007 A discrete version of particle swarm optimization for flowshop scheduling problems Comput Oper Res 34 3099 3111
34. Ross TJ (2004) Fuzzy logic with engineering applications, 2nd edn. Wiley, Chichester
35. M Sakawa R Kubota 2000 Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithms Eur J Oper Res 120 393 407
36. D Laha UK Chakraborty 2008 An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling Int J Adv Manuf Technol 38 1018 1025
37. T Aldowaisan A Allahverdi 1998 Total flowtime in no-wait flowshops with setup times Comput Oper Res 25 757 765
38. C Rajendran H Ziegler 1997 An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs Eur J Oper Res 103 129 138
39. JM Framinan R Leisten R Ruiz-Usano 2005 Comparison of heuristics for flow time minimization in permutation flow shop Comput Oper Res 32 1237 1254
40. S Sarin M Lefoka 1993 Scheduling heuristic for the n-job m-machine flow shop OMEGA Int J Manage Sci 21 2 229 234
41. H Ishibuchi S Misaki H Tanaka 1995 Modified simulated annealing algorithms for the flowshop sequencing problem Eur J Oper Res 81 388 398
42. IH Osman CN Potts 1989 Simulated annealing for permutation flow-shop scheduling OMEGA Int J Manage Sci 17 551 557
43. BM Ben-Daya M Al-Fawzan 1998 A tabu search approach for the flow shop-scheduling problem Eur J Oper Res 109 88 95
44. CR Reeves 1995 A genetic algorithm for flow shop sequencing Comput Oper Res 22 5 11
45. C Rajendran H Ziegler 2004 Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs Eur J Oper Res 155 426 438
46. A Agarwal S Colak E Eryarsoy 2006 Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach Eur J Oper Res 169 801 815
47. SR Hejazi S Saghafian 2005 Flowshop-scheduling problems with makespan criterion: a review Int J Prod Res 43 2895 2929
48. R Ruiz C Maroto 2005 A comprehensive review and evaluation of permutation flow-shop heuristics Eur J Oper Res 165 479 494
49. D Laha UK Chakraborty 2007 An efficient stochastic hybrid heuristic for flowshop scheduling Eng Appl Artif Intell 20 851 856
50. S Kirkpatrick CD Gelatt Jr MP Vecchi 1983 Optimization by simulated annealing Science 220 671 680
51. max flow shop problem Comput Oper Res 17 243 253
52. SG Ponnambalam P Aravindan S Chandrasekaran 2003 Constructive and improvement flow-shop scheduling heuristics: an extensive evaluation Prod Plann Contr 12 4 335 344
53. Stuetzle T (1998) An ant approach for the flow shop problem. In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT'98), vol 3. Verlag Mainz, Aachen, Germany, pp 1560-1564
54. J Liu CR Reeves 2001 Constructive and composite heuristics solution of the left. P \right\|\sum {C-i } scheduling problem Eur J Oper Res 132 439 452
55. VJ Leon B Ramamoorthy 1997 An adaptable problem-space-based search methods for flexible flow line scheduling IIE Trans 29 2 115 125
56. S Turner D Booth 1987 Comparison of heuristics for flow shop sequencing OMEGA Int J Manage Sci 15 1 75 78
57. C Koulamas 1998 A new constructive heuristic for a flowshop-scheduling problem Eur J Oper Res 105 66 71
58. H Davoud Pour 2001 A new heuristic for the n-job, m-machine flow-shop problem Prod Plann Contr 12 7 648 653
59. Merkle D, Middendorf M (2000) An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the Evo Workshops 2000. In: Lecture Notes in Computer Science, vol 1803. Springer, Berlin, pp 287-296
60. E Taillard 1993 Benchmarks for basic scheduling problems Eur J Oper Res 64 278 285
61. DS Palmer 1965 Sequencing jobs through a multi-stage process in the total time-a quick method of obtained a near optimum Oper Res Q 16 101 107
62. J Grabowski J Pempera 2007 The permutation flow shop problem with blocking Omega 35 302 311
63. Kreyszig E (1972) Advanced engineering mathematics. Wiley, New York