A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

Computers and Operations Research

Volumn 40, Issue 1, 2013, Pages 117-128

  Pan, Quan Ke ^a,b   Ruiz, Rubén ^c  

^a STATE KEY LABORATORY OF SYNTHETICAL AUTOMATION FOR PROCESS INDUSTRIES   (China)

^b LIAOCHENG UNIVERSITY   (China)

^c INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

Flowshop; Flowtime; Heuristics; Scheduling

Indexed keywords

COMPARISON RESULT; COMPUTATIONAL EVALUATION; COMPUTING PLATFORM; DESIGNS OF EXPERIMENTS; FLOW-SHOPS; FLOW-TIME; HEURISTICS; LITERATURE REVIEWS; MEAN FLOW TIME; PERMUTATION FLOW SHOPS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; STATISTICAL ASSESSMENT; STATISTICAL TOOLS; TOTAL COMPLETION TIME;

STATISTICAL MECHANICS;

SCHEDULING;

EID: 84866148007     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.05.018     Document Type: Review

References (47)

1. R.H. Ahmadi, and U. Bagchi Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop European Journal of Operational Research 44 3 1990 331 336
2. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics 77 1 2002 71 83
3. K.R. Baker Introduction to sequencing and scheduling 1974 Wiley New York
4. H.G. Campbell, R.A. Dudek, and M.L. Smith Heuristic algorithm for n job, m machine sequencing problem Management Science Series B-Application 16 10 1970 B630 B637
5. R.W. Conway, W.I. Maxwell, and L.W. Miller Theory of scheduling 1967 Addison-Wesley Reading, Mass
6. X.Y. Dong, H.K. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers & Operations Research 36 5 2009 1664 1669
7. J.M. Framinan, J.N.D. Gupta, and R. Leisten A review and classification of heuristics for permutation flow-shop scheduling with makespan objective Journal of the Operational Research Society 55 12 2004 1243 1255
8. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimisation in permutation flow shops Omega - International Journal of Management Science 31 4 2003 311 317
9. J.M. Framinan, R. Leisten, and C. Rajendran Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem International Journal of Production Research 41 1 2003 121 148
10. 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 141 3 2002 559 569
11. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimisation in permutation flowshops Computers & Operations Research 32 5 2005 1237 1254
12. T. Gonzalez, and S. Sahni Flowshop and jobshop schedules: complexity and approximation Operations Research 26 1 1978 36 52
13. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 2 1979 287 326
14. J.N.D. Gupta Heuristic algorithms for multistage flowshop scheduling problem AIIE Transactions 4 1 1972 11 18
15. J.N.D. Gupta, and E.F. Stafford Flowshop scheduling research after five decades European Journal of Operational Research 169 3 2006 699 711
16. S.R. Hejazi, and S. Saghafian Flowshop-scheduling problems with makespan criterion: a review International Journal of Production Research 43 14 2005 2895 2929
17. J.C. Ho Flowshop sequencing with mean flowtime objective European Journal of Operational Research 81 3 1995 571 578
18. J.C. Ho, and Y.-L. Chang A new heuristic for the n-job, M-machine flow-shop problem European Journal of Operational Research 52 2 1991 194 202
19. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 9 2009 2638 2646
20. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
21. M.J. Krone, and K. Steiglitz Heuristic-programming solution of a flowshop-scheduling problem Operations Research 22 3 1974 629 638
22. D. Laha, and S.C. Sarin A heuristic to minimize total flow time in permutation flow shop Omega - International Journal of Management Science 37 3 2009 734 739
23. X. Li, L. Liu, and C. Wu A fast method for heuristics in large-scale flow shop scheduling Tsinghua Science & Technology 11 1 2006 12 18
24. Li X, Wang Q. Iterative heuristics for permutation flows hops with total flowtime minimization. In: Shen W, editor. Information technology for balanced manufacturing systems. IFIP TC5, Proceedings of the WG 5.5 seventh international conference on information technology for balanced automation systems in manufacturing and services. New York: Springer; 2006. p. 349-56
25. X.P. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flow shops Omega - International Journal of Management Science 37 1 2009 155 164
26. X.P. Li, and C. Wu An efficient constructive heuristic for permutation flow shops to minimize total flowtime Chinese Journal of Electronics 14 2 2005 203 208
27. i scheduling problem. European Journal of Operational Research 132 2 2001 439 452
28. S. Miyazaki, and N. Nishiyama Analysis for minimizing weighted mean flow-time in flow-shop scheduling Journal of the Operations Research Society of Japan 23 2 1980 118 132
29. S. Miyazaki, N. Nishiyama, and F. Hashimoto An adjacent pairwise approach to the mean flow-time scheduling problem Journal of the Operations Research Society of Japan 21 2 1978 287 299
30. N. Mladenovic, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
31. D.C. Montgomery Design and analysis of experiments 2008 Wiley Hoboken, NJ
32. M. Nawaz, E.E. Enscore Jr, and I. Ham A heuristic algorithm for the m machine, n job flowshop sequencing problem Omega - International Journal of Management Science 11 1 1983 91 95
33. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 4 2008 795 816
34. M. Pinedo Scheduling: theory, algorithms, and systems 2008 Springer New York
35. C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1 1993 65 73
36. C. Rajendran, and D. Chaudhuri A flowshop scheduling algorithm to minimize total flowtime Journal of the Operations Research Society of Japan 34 1 1991 28 46
37. C. Rajendran, and D. Chaudhuri An efficient heuristic approach to the scheduling of jobs in a flowshop European Journal of Operational Research 61 3 1992 318 325
38. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1 1997 129 138
39. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494
40. E. Taillard Some efficient heuristic methods for the flow-shop sequencing problem European Journal of Operational Research 47 1 1990 65 74
41. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285
42. L.X. Tang, and J.Y. Liu A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time Journal of Intelligent Manufacturing 13 1 2002 61 67
43. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947
44. T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs European Journal of Operational Research 167 3 2005 772 795
45. i, scheduling problems European Journal of Operational Research 96 3 1997 636 644
46. H.S. Woo, and D.S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers & Operations Research 25 3 1998 175 182
47. Y. Zhang, X.P. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 3 2009 869 876