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

Aghezzaf, 2002, An integrated model for inventory and production planning in a two-stage hybrid production system, International Journal of Production Research, 40, 4323, 10.1080/00207540210159617 Allahverdi, 2003, The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime, European Journal of Operational Research, 147, 373, 10.1016/S0377-2217(02)00253-9 Allahverdi, 2004, A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, Computers & Operations Research, 31, 157, 10.1016/S0305-0548(02)00143-0 Allouche, 2009, Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions, European Journal of Operational Research, 192, 460, 10.1016/j.ejor.2007.09.038 Amin-Tahmasbi, 2011, Solving a bi-objective flowshop scheduling problem by a multi-objective immune system and comparing with SPEA2+ and SPGA, Advances in Engineering Software, 42, 772, 10.1016/j.advengsoft.2011.05.015 Armentano, 2004, An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem, Journal of Heuristics, 10, 463, 10.1023/B:HEUR.0000045320.79875.e3 Arroyo, 2004, A partial enumeration heuristic for multi-objective flowshop scheduling problems, Journal of the Operational Research Society, 55, 1000, 10.1057/palgrave.jors.2601746 Arroyo, 2005, Genetic local search for multi-objective flowshop scheduling problems, European Journal of Operational Research, 167, 717, 10.1016/j.ejor.2004.07.017 Arroyo, 2011, A GRASP heuristic for the multi-objective permutation flowshop scheduling problem, International Journal of Advanced Manufacturing Technology, 55, 741, 10.1007/s00170-010-3100-x Bagchi, 2006, A review of TSP based approaches for flowshop scheduling, European Journal of Operational Research, 169, 816, 10.1016/j.ejor.2004.06.040 Baker, 1974 Beasley, 1990, Distributing test problems by electronic mail, Journal of the Operational Research Society, 41, 1069, 10.1057/jors.1990.166 Boukef, 2007, A proposed genetic algorithm coding for flow-shop scheduling problems, International Journal of Computers, Communications & Control, 2, 229, 10.15837/ijccc.2007.3.2356 Braglia, 2009, A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness, International Journal of Production Research, 47, 273, 10.1080/00207540701500486 Bülbül, 2004, Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, Naval Research Logistics, 51, 407, 10.1002/nav.20000 Campbell, 1970, A heuristic algorithm for the n-job m-machine sequencing problem, Management Science, 16, 630, 10.1287/mnsc.16.10.B630 Cavalieri, 1998, Hybrid genetic algorithms for a multiple-objective scheduling problem, Journal of Intelligent Manufacturing, 9, 361, 10.1023/A:1008935027685 Chakravarty, 1999, A heuristic for scheduling in flowshop with bicriteria of makespan and maximum tardiness minimization, Production Planning and Control, 10, 707, 10.1080/095372899232777 Chandra, 2009, Permutation flow shop scheduling with earliness and tardiness penalties, International Journal of Production Research, 47, 5591, 10.1080/00207540802124301 Chandrasekaran, 2007, 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, 4012 Chang, 2008, Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems, Applied Mathematics and Computation, 205, 550, 10.1016/j.amc.2008.05.027 Chang, 2007, Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problem, Expert Systems With Applications, 33, 762, 10.1016/j.eswa.2006.06.019 Chang, 2002, The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem, International Journal of Production Economics, 79, 171, 10.1016/S0925-5273(02)00141-X Chiang, 2011, NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems, Expert Systems With Applications, 38, 5986, 10.1016/j.eswa.2010.11.022 Chou, 1999, Two-machine flowshop scheduling with bicriteria problem, Computers & Industrial Engineering, 36, 549, 10.1016/S0360-8352(99)00149-7 Conway, 1967 Daniels, 1990, Multiobjective flowshop scheduling, Naval Research Logistics Quarterly, 37, 981, 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H Demirkol, 1998, Benchmarks for shop scheduling problems, European Journal of Operational Research, 109, 137, 10.1016/S0377-2217(97)00019-2 Dubois-Lacoste, 2011, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Computers & Operations Research, 38, 1219, 10.1016/j.cor.2010.10.008 Eren, 2008, The tricriteria flowshop scheduling problem, International Journal of Advanced Manufacturing Technology, 36, 1210, 10.1007/s00170-007-0931-1 Framinan, 2009, A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms, International Journal of Advanced Manufacturing Technology, 43, 939, 10.1007/s00170-008-1771-3 Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, 55, 1243, 10.1057/palgrave.jors.2601784 Framinan, 2002, Efficient heuristics for flowshop sequencing with objectives of makespan and flowtime minimization, European Journal of Operational Research, 141, 561, 10.1016/S0377-2217(01)00278-8 Framinan, 2006, A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness, International Journal of Production Economics, 99, 28, 10.1016/j.ijpe.2004.12.004 Framinan, 2008, A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria, OR Spectrum, 30, 787, 10.1007/s00291-007-0098-z Frosolini, 2011, A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates, International Journal of Production Research, 49, 5957, 10.1080/00207543.2010.528056 Geiger, 2007, On operators and search space topology in multi-objective flow shop scheduling, European Journal of Operational Research, 181, 195, 10.1016/j.ejor.2006.06.010 Geiger, 2011, Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology, Computers & Industrial Engineering, 61, 805, 10.1016/j.cie.2011.05.013 Gelders, 1978, Four simple heuristics for scheduling a flowshop, International Journal of Production Research, 16, 221, 10.1080/00207547808930015 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: A survey, 287, 10.1016/S0167-5060(08)70356-X Gupta, 1999, Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion, Production Planning and Control, 10, 251, 10.1080/095372899233217 Gupta, 2001, Minimizing total flowtime in a 2-machine flow shop problem with minimum makespan, International Journal of Production Economics, 69, 323, 10.1016/S0925-5273(00)00039-6 Gupta, 2002, Local search heuristics for two-stage flow shop problems with secondary criterion, Computers & Operations Research, 29, 123, 10.1016/S0305-0548(00)00061-7 Gupta, 2006, Flow shop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001 Haq, 2006, A bicriterian flow shop scheduling using artificial neural network, International Journal of Advanced Manufacturing Technology, 30, 1132, 10.1007/s00170-005-0135-5 Ho, 1991, A new heuristic for the n-job, m-machine flowshop problem, European Journal of Operational Research, 52, 194, 10.1016/0377-2217(91)90080-F Hodgson, 1997, Ready-time scheduling with stochastic service times, Operations Research, 46, 779, 10.1287/opre.45.5.779 Huang, 2009, Solving a multi-objective overlapping flow-shop scheduling, International Journal of Advanced Manufacturing Technology, 42, 955, 10.1007/s00170-008-1652-9 Ignall, 1965, Application of the branch and bound technique to some flow shop scheduling problems, Operations Research, 13, 400, 10.1287/opre.13.3.400 Ishibuchi, 1998, A multi-objective genetic local search algorithm and its applications to flowshop scheduling, IEEE Transactions on Systems, Man, and Cybernetics, 28, 392, 10.1109/5326.704576 Ishibuchi, 2003, Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling, IEEE Transactions on Evolutionary Computation, 7, 204, 10.1109/TEVC.2003.810752 Jaszkiewicz, 2002, Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research, 137, 50, 10.1016/S0377-2217(01)00104-7 Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Kalczynski, 2007, On the NEH heuristic for minimizing the makespan in permutation flow shops, OMEGA – The International Journal of Management Science, 35, 53, 10.1016/j.omega.2005.03.003 Khan, 2011, A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem, International Journal of Advanced Operations Management, 3, 88, 10.1504/IJAOM.2011.040661 Khan, 2007, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, International Journal of Computer Mathematics, 84, 1731, 10.1080/00207160701331376 Lee, 2001, Minimizing the total flow time and the tardiness in a two-machine flow shop, International Journal of Systems Science, 32, 365, 10.1080/002077201300029746 Lemesre, 2007, An exact parallel method for a bi-objective permutation flowshop problem, European Journal of Operational Research, 177, 1641, 10.1016/j.ejor.2005.10.011 Liao, 1997, Bicriterion scheduling in the two-machine flowshop, Journal of the Operational Research Society, 48, 929, 10.1057/palgrave.jors.2600442 Liao, 2007, A discrete version of particle swarm optimization for flowshop scheduling problems, Computers & Operations Research, 34, 3099, 10.1016/j.cor.2005.11.017 Lin, 2006, Bicriteria scheduling in a two-machine permutation flowshop, International Journal of Production Research, 44, 2299, 10.1080/00207540500446394 Lin, 2008, Development of new features of ant colony optimization for flowshop scheduling, International Journal of Production Economics, 112, 742, 10.1016/j.ijpe.2007.06.007 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. 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. Liu, 2000, Scheduling flexible flow shops with sequence-dependent setup effects, IEEE Transactions on Robotics and Automation, 16, 408, 10.1109/70.864235 Loukil, 2005, Solving multi-objective production scheduling problems using metaheuristics, European Journal of Operational Research, 161, 42, 10.1016/j.ejor.2003.08.029 McMahon, 1967, Flowshop scheduling with branch and bound method, Operations Research, 15, 473, 10.1287/opre.15.3.473 Melab, 2006, Parallel cooperative meta-heuristics on the computational grid. A case study: the bi-objective flow-shop problem, Parallel Computing, 32, 643, 10.1016/j.parco.2006.01.003 Mesgarpour, 2010, 6022, 166 Minella, 2008, A review and evaluation of multiobjective algorithms for the flowshop scheduling problem, INFORMS Journal on Computing, 20, 451, 10.1287/ijoc.1070.0258 Minella, 2011, Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems, Computers & Operations Research, 38, 1521, 10.1016/j.cor.2011.01.010 Mokotoff, 2009, Multi-objective simulated annealing for permutation flow shop problems, 101 Moore, 1968, An n jobs, one machine sequencing algorithm for minimizing the number of late jobs, Management Science, 15, 102, 10.1287/mnsc.15.1.102 Moslehi, 2009, Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness, International Journal of Production Economics, 122, 763, 10.1016/j.ijpe.2009.07.003 Murata, 1996, Multi-objective genetic algorithm and its applications to flowshop scheduling, Computers & Industrial Engineering, 30, 957, 10.1016/0360-8352(96)00045-9 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. Nagar, 1995, A branch and bound approach for two-machine flowshop scheduling problem, Journal of the Operational Research Society, 46, 721, 10.1057/jors.1995.102 Nagar, 1996, A combined branch and bound and genetic algorithm based approach for a flowshop scheduling problem, Annals of Operations Research, 63, 397, 10.1007/BF02125405 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA – The International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9 Neppalli, 1996, Genetic algorithms for the two-stage bicriteria flowshop problem, European Journal of Operational Research, 95, 356, 10.1016/0377-2217(95)00275-8 Ogbu, 1991, Simulated annealing for the permutation flowshop problem, OMEGA – The International Journal of Management Science, 19, 64, 10.1016/0305-0483(91)90036-S Onwubolu, 2006, Scheduling flow shops using differential evolution algorithm, European Journal of Operational Research, 171, 674, 10.1016/j.ejor.2004.08.043 Osman, 1989, Simulated annealing for permutation flow-shop scheduling, OMEGA – The International Journal of Management Science, 17, 551, 10.1016/0305-0483(89)90059-5 Palmer, 1965, 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, 16, 101, 10.1057/jors.1965.8 Pasupathy, 2006, 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, 27, 804, 10.1007/s00170-004-2249-6 Pinedo, 2002 Ponnambalam, 2004, A TSP-GA multi-objective algorithm for flow-shop scheduling, International Journal of Advanced Manufacturing Technology, 23, 909, 10.1007/s00170-003-1731-x Qian, 2008, A hybrid differential evolution method for permutation flow-shop scheduling, International Journal of Advanced Manufacturing Technology, 38, 757, 10.1007/s00170-007-1115-8 Rabanimotlagh, 2011, An efficient ant colony optimization algorithm for multiobjective flow shop scheduling problem, World Academy of Science, Engineering and Technology, 75, 127 Rahimi-Vahed, 2007, A multi-objective particle swarm for a flowshop scheduling problem, Journal of Combinatorial Optimization, 13, 79, 10.1007/s10878-006-9015-7 Rahimi-Vahed, 2008, Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm, Soft Computing, 12, 435, 10.1007/s00500-007-0210-y Rahimi-Vahed, 2009, A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem, International Journal of Advanced Manufacturing Technology, 41, 1227, 10.1007/s00170-008-1558-6 Rajendran, 1992, Two-stage flowshop scheduling problem with bicriteria, Journal of the Operational Research Society, 43, 871, 10.1057/jors.1992.126 Rajendran, 1994, A heuristic algorithm for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, International Journal of Production Research, 32, 2541, 10.1080/00207549408957083 Rajendran, 1995, Heuristics for scheduling in flowshop with multiple objectives, European Journal of Operational Research, 82, 540, 10.1016/0377-2217(93)E0212-G Rajkumar, 2009, Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs, International Journal of Computer Integrated Manufacturing, 22, 987, 10.1080/09511920902993353 Ravindran, 2005, Flow shop scheduling with multiple objective of minimizing makespan and total flow time, International Journal of Advanced Manufacturing Technology, 25, 1007, 10.1007/s00170-003-1926-1 Reza Hejazi, 2005, Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, 43, 2895, 10.1080/0020754050056417 Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, 165, 479, 10.1016/j.ejor.2004.04.017 Ruiz, 2006, Two new robust genetic algorithms for the flowshop scheduling problem, OMEGA – The International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006 Ruiz, 2009, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness, Computers & Operations Research, 36, 1268, 10.1016/j.cor.2007.12.013 Sayın, 1999, A bicriteria approach to the two-machine flowshop scheduling problem, European Journal of Operational Research, 112, 435, 10.1016/S0377-2217(98)00009-5 Selen, 1986, A mixed-integer goal-programming formulation of the standart flow-shop scheduling problem, Journal of the Operational Research Society, 37, 1121, 10.1057/jors.1986.197 Sha, 2009, A particle swarm optimization for multi-objective flowshop scheduling, International Journal of Advanced Manufacturing Technology, 45, 749, 10.1007/s00170-009-1970-6 Sivrikaya-Serifoğlu, 1998, A bicriteria two-machine permutation flowshop problem, European Journal of Operational Research, 107, 414, 10.1016/S0377-2217(97)00338-X Smith, 1967, A general algorithm for solution of the n-job, m-machine sequencing problem of the flowshop, Operations Research, 15, 71, 10.1287/opre.15.1.71 Sridhar, 1996, Scheduling in flowshop and cellular manufacturing systems with multiple objectives: A genetic algorithmic approach, Production Planning and Control, 7, 374, 10.1080/09537289608930365 Sun, 2011, Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects, International Journal of Advanced Manufacturing Technology, 55, 723, 10.1007/s00170-010-3094-4 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. Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M T'kindt V,, 2002 T'kindt, 2002, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, European Journal of Operational Research, 142, 250, 10.1016/S0377-2217(02)00265-5 T'kindt, 2003, Two-machine flowshop scheduling with a secondary criterion, Computers & Operations Research, 30, 505, 10.1016/S0305-0548(02)00021-7 Toktaş, 2004, Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan, European Journal of Operational Research, 157, 286, 10.1016/S0377-2217(03)00192-9 Tseng, 2004, An Empirical analysis of integer programming formulations for the permutation flowshop, OMEGA – The International Journal of Management Science, 32, 285, 10.1016/j.omega.2003.12.001 Uysal, 2008, Comparison of genetic algorithm and particle swarm optimization for bicriteria permutation flowshop scheduling problem, International Journal of Computational Intelligence Research, 4, 159 Vallada, 2010, Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem, OMEGA – The International Journal of Management Science, 38, 57, 10.1016/j.omega.2009.04.002 Vallada, 2009, Cooperative metaheuristics for the permutation flowshop scheduling problem, European Journal of Operational Research, 193, 365, 10.1016/j.ejor.2007.11.049 Varadharajan, 2005, 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, 772, 10.1016/j.ejor.2004.07.020 Wilson, 1989, Alternative formulations of a flowshop scheduling problem, Journal of the Operational Research Society, 40, 395, 10.1057/palgrave.jors.0400410 Xu, 2009, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem, Information Sciences, 179, 2997, 10.1016/j.ins.2009.04.009 Yagmahan, 2008, Ant colony optimization for multi-objective flow shop scheduling problem, Computers & Industrial Engineering, 54, 411, 10.1016/j.cie.2007.08.003 Yagmahan, 2010, A multi-objective ant colony system algorithm for flow shop scheduling problem, Expert Systems With Applications, 37, 1361, 10.1016/j.eswa.2009.06.105 Yandra, 2007, A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems, International Journal of Computer Integrated Manufacturing, 20, 465, 10.1080/09511920601160288 Yeh, 1999, A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problem, Computers & Operations Research, 26, 1293, 10.1016/S0305-0548(98)00106-3 Yeh, 2001, An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem, Journal of Manufacturing Systems, 20, 113, 10.1016/S0278-6125(01)80034-0 Yeh, 2002, A memetic algorithm for the n/2/Flowshop/αF+βCmax scheduling problem, International Journal of Advanced Manufacturing Technology, 20, 464, 10.1007/s001700200179