Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends

Omega (United Kingdom)

Volumn 45, Issue , 2014, Pages 119-135

  Yenisey, Mehmet Mutlu ^a   Yagmahan, Betul ^b  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

^b ULUDAG UNIVERSITY   (Turkey)

Author keywords

Flow shop; Literature review; Multi objective; Research directions; Scheduling

Indexed keywords

EID: 84893734286     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2013.07.004     Document Type: Review

References (127)

1. Aghezzaf E.-H., Van Landeghem H. An integrated model for inventory and production planning in a two-stage hybrid production system. International Journal of Production Research 2002, 40(17):4323-4339.
2. Allahverdi A. The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. European Journal of Operational Research 2003, 147(2):373-396.
3. Allahverdi A. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Computers & Operations Research 2004, 31(2):157-180.
4. Allouche M.A., Aouni B., Martel J.-M., Loukil T., Rebayi A. Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions. European Journal of Operational Research 2009, 192:460-467.
5. Amin-Tahmasbi H., Tavakkoli-Moghaddam R. Solving a bi-objective flowshop scheduling problem by a multi-objective immune system and comparing with SPEA2+ and SPGA. Advances in Engineering Software 2011, 42:772-779.
6. Armentano V.A., Arroyo J.C. An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem. Journal of Heuristics 2004, 10:463-481.
7. Arroyo J.C., Armentano V.A. A partial enumeration heuristic for multi-objective flowshop scheduling problems. Journal of the Operational Research Society 2004, 55:1000-1007.
8. Arroyo J.C., Armentano V.A. Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 2005, 167:717-738.
9. Arroyo J.C., Souza Pereira A.A. A GRASP heuristic for the multi-objective permutation flowshop scheduling problem. International Journal of Advanced Manufacturing Technology 2011, 55:741-753.
10. Bagchi T.P., Gupta J.N.D., Sriskandarajah C. A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research 2006, 169:816-854.
11. Baker K.R. Introduction to sequencing and scheduling 1974, Wiley, New York.
12. Beasley J.E. Distributing test problems by electronic mail. Journal of the Operational Research Society 1990, 41(11):1069-1072.
13. Boukef H., Benrejep M., Borne P. A proposed genetic algorithm coding for flow-shop scheduling problems. International Journal of Computers, Communications & Control 2007, 2(3):229-240.
14. Braglia M., Grassi A. A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research 2009, 47(1):273-288.
15. Bülbül K., Kaminsky P., Yano C. Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Naval Research Logistics 2004, 51:407-445.
16. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the n-job m-machine sequencing problem. Management Science 1970, 16(10):630-637.
17. Cavalieri S., Gaiardelli P. Hybrid genetic algorithms for a multiple-objective scheduling problem. Journal of Intelligent Manufacturing 1998, 9(4):361-367.
18. Chakravarty K., Rajendran C. A heuristic for scheduling in flowshop with bicriteria of makespan and maximum tardiness minimization. Production Planning and Control 1999, 10:707-714.
19. Chandra P., Mehta P., Tirupati D. Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research 2009, 47(20):5591-5610.
20. Chandrasekaran S., Ponnambalam S.G., Suresh R.K., Vijayakumar N. Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance. IEEE Congress on Evolutionary Computation (CEC 2007, 2007:4012-4018.
21. Chang P.-C., Chen S.-H., Fan C.-Y., Chan C.-L. Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems. Applied Mathematics and Computation 2008, 205:550-561.
22. Chang P.-C., Chen S.-H., Liu C.-H. Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problem. Expert Systems With Applications 2007, 33:762-771.
23. Chang P.-C., Hsieh J.-C., Lin S.-G. The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem. International Journal of Production Economics 2002, 79(3):171-183.
24. Chiang T.-C., Cheng H.-C., Fu L.-C. NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems With Applications 2011, 38:5986-5999.
25. Chou F.D., Lee C.E. Two-machine flowshop scheduling with bicriteria problem. Computers & Industrial Engineering 1999, 36:549-564.
26. Conway R.W., Maxwell W.L., Miller L.W. Theory of scheduling 1967, Addison-Wesley Publishing Company, Massachusetts.
27. Daniels R.L., Chambers R.J. Multiobjective flowshop scheduling. Naval Research Logistics Quarterly 1990, 37:981-995.
28. Demirkol E., Mehta S., Uzsoy R. Benchmarks for shop scheduling problems. European Journal of Operational Research 1998, 109(1):137-141.
29. Dubois-Lacoste J., López-Ibáñez M., Stutzle T. A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research 2011, 38:1219-1236.
30. Eren T., Güner E. The tricriteria flowshop scheduling problem. International Journal of Advanced Manufacturing Technology 2008, 36:1210-1220.
31. Framinan J.M. A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms. International Journal of Advanced Manufacturing Technology 2009, 43:939-948.
32. Framinan J.M., Gupta J.N.D., Leisten R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 2004, 55(12):1243-1255.
33. Framinan J.M., Leisten R., Ruiz-Usano R. Efficient heuristics for flowshop sequencing with objectives of makespan and flowtime minimization. European Journal of Operational Research 2002, 141:561-571.
34. Framinan J.M., Leisten R. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness. International Journal of Production Economics 2006, 99:28-40.
35. Framinan J.M., Leisten R. A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. OR Spectrum 2008, 30:787-804.
36. Frosolini M., Braglia M., Zammori F.A. A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates. International Journal of Production Research 2011, 49(20):5957-5985.
37. Geiger M.J. On operators and search space topology in multi-objective flow shop scheduling. European Journal of Operational Research 2007, 181:195-206.
38. Geiger M.J. Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology. Computers & Industrial Engineering 2011, 61:805-812.
39. Gelders L.F., Samdandam N. Four simple heuristics for scheduling a flowshop. International Journal of Production Research 1978, 16:221-231.
40. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of discrete mathematics 5, discrete optimization II 1979, 287-326. North-Holland Publishing Company, Amsterdam. P.L. Hammer, E.L. Johnson, B.H. Korte (Eds.).
41. Gupta J.N.D., Palanimuthy N., Chen C.L. Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Production Planning and Control 1999, 10:251-265.
42. Gupta J.N.D., Hennig K., Werner F. Minimizing total flowtime in a 2-machine flow shop problem with minimum makespan. International Journal of Production Economics 2001, 69:323-338.
43. Gupta J.N.D., Hennig K., Werner F. Local search heuristics for two-stage flow shop problems with secondary criterion. Computers & Operations Research 2002, 29(2):123-149.
44. Gupta J.N.D., Stafford E.F. Flow shop scheduling research after five decades. European Journal of Operational Research 2006, 169:699-711.
45. Haq A., Ramanan T.R. A bicriterian flow shop scheduling using artificial neural network. International Journal of Advanced Manufacturing Technology 2006, 30:1132-1138.
46. Ho J.C., Chang Y.L. A new heuristic for the n-job, m-machine flowshop problem. European Journal of Operational Research 1991, 52:194-202.
47. Hodgson T.J., King R.E., Stanfield P.M. Ready-time scheduling with stochastic service times. Operations Research 1997, 46(5):779-783.
48. Huang R.-H., Yang C.-L. Solving a multi-objective overlapping flow-shop scheduling. International Journal of Advanced Manufacturing Technology 2009, 42(9-10):955-962.
49. Ignall E., Schrage L. Application of the branch and bound technique to some flow shop scheduling problems. Operations Research 1965, 13(3):400-412.
50. Ishibuchi H., Murata T. A multi-objective genetic local search algorithm and its applications to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics 1998, 28(3):392-403.
51. Ishibuchi H., Yoshida T., Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 2003, 7(2):204-223.
52. Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research 2002, 137:50-71.
53. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954, 1(1):61-68.
54. Kalczynski P.J., Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA - The International Journal of Management Science 2007, 35(1):53-60.
55. Khan B.S.H., Govindan K. A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem. International Journal of Advanced Operations Management 2011, 3(1):88-100.
56. Khan B.S.H., Prabhaharan G., Asokan P. A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. International Journal of Computer Mathematics 2007, 84(12):1731-1741.
57. Lee W.C., Wu C.C. Minimizing the total flow time and the tardiness in a two-machine flow shop. International Journal of Systems Science 2001, 32(3):365-373.
58. Lemesre J., Dhaenens C., Talbi E.-G. An exact parallel method for a bi-objective permutation flowshop problem. European Journal of Operational Research 2007, 177:1641-1655.
59. Liao C.-J., Yu W.-C., Joe C.-B. Bicriterion scheduling in the two-machine flowshop. Journal of the Operational Research Society 1997, 48(9):929-935.
60. Liao C.-J., Tseng C.-T., Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 2007, 34:3099-3111.
61. Lin B.M.T., Wu J.M. Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research 2006, 44(12):2299-2312.
62. Lin B.M.T., Lu C.Y., Shyu S.J., Tsai C.Y. Development of new features of ant colony optimization for flowshop scheduling. International Journal of Production Economics 2008, 112:742-755.
63. Lin S.-W., Ying K.-C., Minimizing makespan and total flow time in permutation flow shops by a bi-objective multi-start simulated-annealing algorithm, Computers & Operations Research 2013;40(6):1625-1647.
64. Liu C.-H., Wang Y.-W., Tzeng Y.-S., Sub-population artificial immune system for multi-objective flowshop scheduling problems. Fifth international conference on computer sciences and convergence information technology (ICCIT 2010), Seoul, Korea, 2010, pp. 872-877.
65. Liu C.-Y., Chang S.-C. Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 2000, 16(4):408-419.
66. Loukil T., Teghem J., Tuyttens D. Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research 2005, 161:42-61.
67. McMahon G.B., Burton P. Flowshop scheduling with branch and bound method. Operations Research 1967, 15(3):473-481.
68. Melab N., Mezmaz M., Talbi E.-G. Parallel cooperative meta-heuristics on the computational grid. A case study: the bi-objective flow-shop problem. Parallel Computing 2006, 32:643-659.
69. Mesgarpour M., Kirkavak N., Ozaktas H. Bicriteria scheduling problem on the two-machine flowshop using simulated annealing, Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science 2010, 6022:166-177. Springer.
70. Minella G., Ruiz R., Ciavotta M. A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 2008, 20(3):451-471.
71. Minella G., Ruiz R., Ciavotta M. Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Computers & Operations Research 2011, 38:1521-1533.
72. Mokotoff E. Multi-objective simulated annealing for permutation flow shop problems. Computational intelligence in flow shop and job shop scheduling 2009, 101-150. Springer-Verlag, Berlin, Heidelberg. U.K. Chakraborty (Ed.).
73. Moore J.M. An n jobs, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 1968, 15(1):102-109.
74. Moslehi G., Mirzaee M., Vasei M., Modarres M., Azaron A. Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. International Journal of Production Economics 2009, 122(2):763-773.
75. Murata T., Ishibuchi H., Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers & Industrial Engineering 1996, 30(4):957-968.
76. Murata T., Ishibuchi H., Gen M., Specification of genetic search directions in cellular multi-objective genetic algorithms. In: Zitzler E, Deb K, Thiele L, Coello CA, Corne D, Editors, Evolutionary multi-criterion optimization, First international conference, EMO 2001, Zurich, Switzerland, Lecture Notes in Computer Science, vol. 1993, Springer, 2001, p. 82-95.
77. Nagar A., Heragu S.S., Haddock J. A branch and bound approach for two-machine flowshop scheduling problem. Journal of the Operational Research Society 1995, 46:721-734.
78. Nagar A., Heragu S.S., Haddock J. A combined branch and bound and genetic algorithm based approach for a flowshop scheduling problem. Annals of Operations Research 1996, 63:397-414.
79. Nawaz M., Enscore E., Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA - The International Journal of Management Science 1983, 11(1):91-95.
80. Neppalli V.R., Chen C.-L., Gupta J.N.D. Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operational Research 1996, 95(2):356-373.
81. Ogbu F.A., Smith D.K. Simulated annealing for the permutation flowshop problem. OMEGA - The International Journal of Management Science 1991, 19:64-67.
82. Onwubolu G., Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 2006, 171(2):674-692.
83. Osman I.H., Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA - The International Journal of Management Science 1989, 17(6):551-557.
84. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining near optimum. Journal of the Operational Research Society 1965, 16(1):101-107.
85. Pasupathy T., Rajendran C., Suresh R.K. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. International Journal of Advanced Manufacturing Technology 2006, 27:804-815.
86. Pinedo M. Scheduling: theory, algorithms, and systems 2002, Prentice-Hall Inc., New Jersey. 2nd ed.
87. Ponnambalam S.G., Jagannathan H., Kataria M., Gadicherla A. A TSP-GA multi-objective algorithm for flow-shop scheduling. International Journal of Advanced Manufacturing Technology 2004, 23:909-915.
88. Qian B., Wang L., Hu R., Wang W.L., Huang D.X., Wang X. A hybrid differential evolution method for permutation flow-shop scheduling. International Journal of Advanced Manufacturing Technology 2008, 38:757-777.
89. Rabanimotlagh A. An efficient ant colony optimization algorithm for multiobjective flow shop scheduling problem. World Academy of Science, Engineering and Technology 2011, 75:127-133.
90. Rahimi-Vahed A.R., Mirghorbani S.M. A multi-objective particle swarm for a flowshop scheduling problem. Journal of Combinatorial Optimization 2007, 13(1):79-102.
91. Rahimi-Vahed A.R., Mirzaei A.H Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. Soft Computing 2008, 12:435-452.
92. Rahimi-Vahed A.R., Dangchi M., Rafiei H., Salimi E. A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. International Journal of Advanced Manufacturing Technology 2009, 41:1227-1239.
93. Rajendran C. Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society 1992, 43(9):871-884.
94. Rajendran C. A heuristic algorithm for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 1994, 32:2541-2558.
95. Rajendran C. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research 1995, 82:540-555.
96. Rajkumar R., Shahabudeen P. Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs. International Journal of Computer Integrated Manufacturing 2009, 22(10):987-998.
97. Ravindran D., Noorul Haq A., Selvakuar S.J., Sivaraman R. Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advanced Manufacturing Technology 2005, 25:1007-1012.
98. Reza Hejazi S., Saghafian S. Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 2005, 43(14):2895-2929.
99. Ruiz R., Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 2005, 165:479-494.
100. Ruiz R., Maroto C., Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA - The International Journal of Management Science 2006, 34(5):461-476.
101. Ruiz R., Allahverdi A. Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Computers & Operations Research 2009, 36(4):1268-1283.
102. Sayin S., Karabati S. A bicriteria approach to the two-machine flowshop scheduling problem. European Journal of Operational Research 1999, 112:435-449.
103. Selen W.J., Hott D. A mixed-integer goal-programming formulation of the standart flow-shop scheduling problem. Journal of the Operational Research Society 1986, 37:1121-1128.
104. Sha D.Y., Lin H.-H. A particle swarm optimization for multi-objective flowshop scheduling. International Journal of Advanced Manufacturing Technology 2009, 45:749-758.
105. Sivrikaya-Serifoǧlu F., Ulusoy G. A bicriteria two-machine permutation flowshop problem. European Journal of Operational Research 1998, 107:414-430.
106. Smith M.L., Dudek R.A. A general algorithm for solution of the n-job, m-machine sequencing problem of the flowshop. Operations Research 1967, 15:71-82.
107. Sridhar C., Rajendran C. Scheduling in flowshop and cellular manufacturing systems with multiple objectives: A genetic algorithmic approach. Production Planning and Control 1996, 7:374-382.
108. Sun Y., Zhang C., Gao L., Wang X. Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. International Journal of Advanced Manufacturing Technology 2011, 55:723-739.
109. Suresh R.K., Mohanasundaram K.M., Pareto archived simulated annealing for permutation flow shop scheduling with multiple objective. In: Proceedings of the 2004 IEEE conference on cybernetics and intelligent systems, Singapore, 2004, p. 712-17.
110. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993, 64:278-285.
111. T'kindt V, Billaut J.-C. Multicriteria scheduling: theory, models and algorithms 2002, Springer-Verlag, Berlin.
112. T'kindt V., Monmarché N., Tercinet F., Laügt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research 2002, 142:250-257.
113. T'kindt V., Gupta JND, Billaut J-C. Two-machine flowshop scheduling with a secondary criterion. Computers & Operations Research 2003, 30(4):505-526.
114. Toktaş B., Azizoǧlu M., Köksalan S.K. Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. European Journal of Operational Research 2004, 157(2):286-295.
115. Tseng F.T., Stafford E.F., Gupta J.N.D. An Empirical analysis of integer programming formulations for the permutation flowshop. OMEGA - The International Journal of Management Science 2004, 32(4):285-293.
116. Uysal O., Bulkan S. Comparison of genetic algorithm and particle swarm optimization for bicriteria permutation flowshop scheduling problem. International Journal of Computational Intelligence Research 2008, 4(2):159-175.
117. Vallada E., Ruiz R. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. OMEGA - The International Journal of Management Science 2010, 38(1-2):57-67.
118. Vallada E., Ruiz R. Cooperative metaheuristics for the permutation flowshop scheduling problem. European Journal of Operational Research 2009, 193(2):365-376.
119. Varadharajan T.K., Rajendran C. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 2005, 167:772-795.
120. Wilson J.M. Alternative formulations of a flowshop scheduling problem. Journal of the Operational Research Society 1989, 40(4):395-399.
121. Xu J., Zhou X. A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem. Information Sciences 2009, 179:2997-3017.
122. Yagmahan B., Yenisey M.M. Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering 2008, 54(3):411-420.
123. Yagmahan B., Yenisey M.M. A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Systems With Applications 2010, 37(2):1361-1368.
124. Yandra H.Tamura A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems. International Journal of Computer Integrated Manufacturing 2007, 20(5):465-477.
125. Yeh W.-C. A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problem. Computers & Operations Research 1999, 26(13):1293-1310.
126. Yeh W.-C. An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem. Journal of Manufacturing Systems 2001, 20:113-123.
127. Yeh W.-C. A memetic algorithm for the n/2/Flowshop/αF+βCmax scheduling problem. International Journal of Advanced Manufacturing Technology 2002, 20:464-473.