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

Ahmadi, 1990, 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, 331, 10.1016/0377-2217(90)90244-6

Allahverdi, 2002, New heuristics to minimize total completion time in m-machine flowshops, International Journal of Production Economics, 77, 71, 10.1016/S0925-5273(01)00228-6

Baker, 1974

Campbell, 1970, Heuristic algorithm for n job, m machine sequencing problem, Management Science Series B-Application, 16, B630

Conway, 1967

Dong, 2009, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Computers & Operations Research, 36, 1664, 10.1016/j.cor.2008.04.001

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, 2003, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, Omega—International Journal of Management Science, 31, 311, 10.1016/S0305-0483(03)00047-1

Framinan, 2003, 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, 121, 10.1080/00207540210161650

Framinan, 2002, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research, 141, 559, 10.1016/S0377-2217(01)00278-8

Framinan, 2005, Comparison of heuristics for flowtime minimisation in permutation flowshops, Computers & Operations Research, 32, 1237, 10.1016/j.cor.2003.11.002

Gonzalez, 1978, Flowshop and jobshop schedules: complexity and approximation, Operations Research, 26, 36, 10.1287/opre.26.1.36

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X

Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823

Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001

Hejazi, 2005, Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, 43, 2895, 10.1080/0020754050056417

Ho, 1995, Flowshop sequencing with mean flowtime objective, European Journal of Operational Research, 81, 571, 10.1016/0377-2217(93)E0353-Y

Ho, 1991, A new heuristic for the n-job, M-machine flow-shop problem, European Journal of Operational Research, 52, 194, 10.1016/0377-2217(91)90080-F

Jarboui, 2009, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Computers & Operations Research, 36, 2638, 10.1016/j.cor.2008.11.004

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110

Krone, 1974, Heuristic-programming solution of a flowshop-scheduling problem, Operations Research, 22, 629, 10.1287/opre.22.3.629

Laha, 2009, A heuristic to minimize total flow time in permutation flow shop, Omega—International Journal of Management Science, 37, 734, 10.1016/j.omega.2008.05.002

Li, 2006, A fast method for heuristics in large-scale flow shop scheduling, Tsinghua Science & Technology, 11, 12, 10.1016/S1007-0214(06)70148-1

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

Li, 2009, Efficient composite heuristics for total flowtime minimization in permutation flow shops, Omega—International Journal of Management Science, 37, 155, 10.1016/j.omega.2006.11.003

Li, 2005, An efficient constructive heuristic for permutation flow shops to minimize total flowtime, Chinese Journal of Electronics, 14, 203

Liu, 2001, Constructive and composite heuristic solutions to the P//ΣCi scheduling problem., European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5

Miyazaki, 1980, Analysis for minimizing weighted mean flow-time in flow-shop scheduling, Journal of the Operations Research Society of Japan, 23, 118, 10.15807/jorsj.23.118

Miyazaki, 1978, An adjacent pairwise approach to the mean flow-time scheduling problem, Journal of the Operations Research Society of Japan, 21, 287, 10.15807/jorsj.21.287

Mladenovic, 1997, Variable neighborhood search, Computers & Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2

Montgomery, 2008

Nawaz, 1983, A heuristic algorithm for the m machine, n job flowshop sequencing problem, Omega—International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9

Pan, 2008, A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Computers & Industrial Engineering, 55, 795, 10.1016/j.cie.2008.03.003

Pinedo, 2008

Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F

Rajendran, 1991, A flowshop scheduling algorithm to minimize total flowtime, Journal of the Operations Research Society of Japan, 34, 28, 10.15807/jorsj.34.28

Rajendran, 1992, An efficient heuristic approach to the scheduling of jobs in a flowshop, European Journal of Operational Research, 61, 318, 10.1016/0377-2217(92)90361-C

Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1

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

Taillard, 1990, Some efficient heuristic methods for the flow-shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X

Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M

Tang, 2002, A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time, Journal of Intelligent Manufacturing, 13, 61, 10.1023/A:1013681029869

Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024

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

Wang, 1997, Heuristic approaches for n/m/F/ΣCi, scheduling problems, European Journal of Operational Research, 96, 636, 10.1016/0377-2217(95)00347-9

Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Computers & Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6

Zhang, 2009, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, European Journal of Operational Research, 196, 869, 10.1016/j.ejor.2008.04.033