An empirical analysis of the optimality rate of flow shop heuristics

European Journal of Operational Research

Volumn 198, Issue 1, 2009, Pages 93-101

  Kalczynski, Pawel J ^a   Kamburowski, Jerzy ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TOLEDO   (United States)

Author keywords

Flow shop; Heuristics; Makespan; Optimality; Scheduling

Indexed keywords

CONTROL THEORY; HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; MANAGEMENT SCIENCE; OPTIMIZATION; SCHEDULING;

EMPIRICAL ANALYSIS; EMPIRICAL STUDIES; FLOW SHOP; HEURISTICS; LOWER BOUNDS; MAKESPAN; NP-HARD; OPTIMALITY; OPTIMIZATION PROBLEMS; PROBLEM SIZES; SEQUENCING PROBLEMS; STRONGLY NP-HARD;

HEURISTIC METHODS;

EID: 62749100721     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.08.021     Document Type: Article

References (68)

1. Agarval A., Colak S., and Eryarsoy E. Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach. European Journal of Operational Research 169 (2006) 801-815
2. Aldowaisan T., and Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 30 (2003) 1219-1231
3. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job m machine sequencing problem. Management Science 16 (1970) 630-637
4. Chakraborty U.K., and Laha D. An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communication Technology 1 (2007) 89-97
5. Chen B., Potts N., and Woeginger G.J. A review of machine scheduling: Complexity, algorithms and approximability. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publishers., Dordrecht, The Netherlands 21-170
6. max problems. Computers & Operations Research 34 (2007) 938-953
7. Dannenbring D.G. An evaluation of flow-shop sequencing heuristics. Management Science 23 (1977) 1174-1182
8. Dong X., Huang H., and Chen P. An improved NEH-based heuristic for the permutation flowshop problem. Computers and Operations Research 35 (2008) 3962-3968
9. Ekşioǧlu B., Ekşioǧlu S.D., and Jain P. A tabu search algorithm for the flowshop scheduling problem with changing neighbourhoods. Computers and Industrial Engineering 54 (2008) 1-11
10. Etiler O., Toklu B., Atak M., and Wilson J. A genetic algorithm for flow shop scheduling problem. Journal of the Operational Research Society 55 (2004) 830-835
11. Framinan J.M., Leisten R., and Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop problem. International Journal of Production Research 41 (2003) 121-148
12. Framinan J.M., Gupta J.N.D., and Leisten R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55 (2004) 1243-1255 (Erratum (2005), 56, 351)
13. Gao S.-W., Lin C., and Zhang W.-D. Enhanced NEH method in solving permutation flow shop problem. Journal of Shanghai Jiaotong University (Science) 12 (2007) 47-52
14. Garey M.R.D., Johnson D.S., and Sethi R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
15. Gilmore P.C., and Gomory R.E. Sequencing a one state variable machine: A solvable case of the traveling salesman problem. Operations Research 12 (1964) 655-679
16. Glynn P.W., and Whitt W. Departures from many queues in series. Annals of Applied Probability 1 (1991) 546-572
17. Grabowski J., and Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research 32 (2005) 2197-2212
18. Grabowski J., and Pempera J. The permutation flowshop problem with blocking. A tabu search approach. Omega, the International Journal of Management Science 35 (2007) 302-311
19. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31 (2004) 1891-1909
20. Gupta J.N.D., Koulamas C., and Kyparisis G.J. Performance guarantees for flowshop heuristics to minimize makespan. European Journal of Operational Research 169 (2006) 865-872
21. Hall L. Approximability of flow shop scheduling. Mathematical Programming 82 (1998) 175-190
22. Haq A.N., Saravanan M., Vivekraj A.R., and Prasad T. A scatter search approach for general flow shop scheduling problem. International Journal of Advanced Manufacturing Technology 31 (2007) 751-761
23. Iyer S.K., and Saxena B. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research 31 (2004) 593-606
24. James F. RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Luscher. Computer Physics Communications 97 (1996) 357
25. Jarboui B., Ibrahim S., Siarry P., and Rebai A. A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers & Industrial Engineering 54 (2008) 526-538
26. Jin F., Song S., and Wu C. An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems. IIE Transactions 39 (2007) 229-234
27. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
28. Johnson S.M. Discussion: Sequencing n jobs on two machines with arbitrary time lags. Management Science 5 (1959) 299-303
29. Kalczynski P.J., and Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flowshops. Omega, The International Journal of Management Science 35 (2007) 53-60
30. Kalczynski P.J., and Kamburowski J. An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research 35 (2008) 3001-3008
31. Koryakin R. On asymptotic optimality of permutation schedules in stochastic flow shops and assembly lines. Operations Research Proceedings, Part 6 (2004) 200-206
32. Ladhari T., and Haouari M. A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research 32 (2005) 1831-1847
33. Laha D., and Mandal P. Improved heuristically guided genetic algorithm for the flow shop scheduling problem. International Journal of Services and Operations Management 3 (2007) 313-331
34. Lenstra J.K., Rinnoy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
35. Liao C.-J., Tseng C.-T., and Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 34 (2007) 3099-3111
36. Liu B., Wang L., and Jin Y.-H. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology 31 (2007) 1001-1011
37. Liu B., Wang L., and Jin Y.-H. An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics - Part B. Cybernetics 37 (2007) 18-27
38. Lourenço H.L. Sevast'janov's algorithm for the flow-shop scheduling problem. European Journal of Operational Research 91 (1996) 176-189
39. McMahon G.B. A Study of Algorithms for Industrial Engineering Problems (1971), University of New South Wales, Kensington
40. Nawaz M., Enscore Jr. E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, The International Journal of Management Science 11 (1983) 91-95
41. Nowicki E. The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research 116 (1999) 205-219
42. Nowicki E., and Smutnicki C. New results in the worst-case analysis for flow-shop scheduling. Discrete Applied Mathematics 46 (1993) 21-41
43. Nowicki E., and Smutnicki C. A note on worst-case analysis of approximation algorithms for a scheduling problem. European Journal of Operational Research 74 (1994) 128-134
44. Nowicki E., and Smutnicki C. Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research 169 (2006) 654-666
45. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 (2006) 674-692
46. Pan, Q.-K, Tasgetiren, M.F., Liang, Y.-C., 2007. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. In: Ninth Annual Conference o Genetic and Evolutionary Computation, GECCO '07. London, UK.
47. Pinedo M. Scheduling: Theory, Algorithms, and Systems (2002), Prentice Hall, Upper Saddle, NJ
48. Portougal V.M. Asymptotic behaviour of some scheduling algorithms. Asia-Pacific Journal of Operational Research 10 (1993) 79-91
49. Portougal V., and Smith J.L. The asymptotic convergence of some flow-shop scheduling heuristics. Asia-Pacific Journal of Operational Research 18 (2001) 243-256
50. Prabhaharan G., Khan B.S.H., and Rakesh L. Implementation of grasp in flow shop scheduling. International Journal of Advanced Manufacturing Technology 30 (2006) 1126-1131
51. Psaraftis H.N. On the practical importance of asymptotic optimality in certain heuristic algorithms. Networks 14 (1984) 587-596
52. Rad S.F., Ruiz R., and Boroojerdian N. New high performing heuristics for minimizing makespan in permutation flowshops. Omega, The International Journal of Operational Research 37 (2009) 331-345
53. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438
54. Ramudhin A., Bratholdi III J.J., Calvin J., Vande Vate J.H., and Weiss G. A probabilistic analysis of two-machine flowshops. Operations Research 44 (1996) 899-908
55. Reza Hejazi S., and Saghafian S. Flowshop-scheduling with makespan criterion: a review. International Journal of Production Research 43 (2005) 2895-2929
56. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 (2005) 479-494
57. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 (2007) 2033-2049
58. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega, The International Journal of Management Science 34 (2006) 461-476
59. Schuurman, P., Woeginger, G.J., 2007. Approximation schemes - a tutorial. In: Moehring, R.H., Potts, C.N., Schulz, A.S., Woeginger, G.J., Wolsey, L.A. (Eds), Lectures on Scheduling. (available online).
60. Sevast'janov S. Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Mathematics of Operations Research 20 (1995) 90-103
61. Shmoys D.B., Stein C., and Wein J. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing 23 (1994) 617-632
62. Smutnicki C. Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research 109 (1998) 66-87
63. Suliman S.M.A. A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 64 (2000) 143-152
64. Sviridenko M.I. A note on the permutation flow shop problem. Annals of Operations Research 129 (2004) 247-252
65. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 (1990) 65-74
66. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
67. Tasgetiren M.Y.-C.L., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
68. Ying K.-C., and Liao C.-J. An ant colony system for permutation flow-shop sequencing. Computers & Operations Research 31 (2004) 791-801