An efficient constructive heuristic for flowtime minimisation in permutation flow shops

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 Pinedo, 1995 French, 1982 Rajendran, 1994, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, International Journal of Production Research, 32, 2541, 10.1080/00207549408957083 Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117 Rinnooy Kan, 1976 Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823 Miyazaki, 1978, An adjacent pairwise approach to the mean flowtime scheduling problem, Journal of the Operations Research Society of Japan, 21, 287, 10.15807/jorsj.21.287 Rajendran, 1991, 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, 1993, Heuristic algorithm for scheduling in a flowshop to minimise total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F Ho, 1995, Flowshop sequencing with mean flowtime objective, European Journal of Operational Research, 81, 571, 10.1016/0377-2217(93)E0353-Y 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 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 and Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6 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, 561, 10.1016/S0377-2217(01)00278-8 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9 Campbell, 1970, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, B630, 10.1287/mnsc.16.10.B630 Ahmadi, 1990, Improved lower bounds for minimizing the sum of completion times of n jobs over m machines, European Journal of Operational Research, 44, 331, 10.1016/0377-2217(90)90244-6 Taillard, 1990, Some efficient methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Turner, 1987, Comparison of heuristics for flowshop sequencing, Omega, 15, 75, 10.1016/0305-0483(87)90054-5 Baker, 1974