A heuristic algorithm for mean flowtime objective in flowshop scheduling

Adiri, 1982, Flowshop/no-idle or no wait scheduling to minimize the sum of completion time, Naval Research Logistics Quarterly, 29, 395, 10.1002/nav.3800290311

Ahmadi, 1990, Improved lower bounds for minimizing the sum of flowtimes of n jobs over m machines in a flow shop, European Journal of Operational Research, 44, 331, 10.1016/0377-2217(90)90244-6

Baker, 1974

Bansal, 1977, Minimizing the sum of completion times of n -jobs over m machines in a flow shop, AIIE Transactions, 9, 306, 10.1080/05695557708975160

Bestwick, 1976, A new bound for machine scheduling, Operations Research Quarterly, 27, 479, 10.1057/jors.1976.93

Campbell, 1970, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, 630, 10.1287/mnsc.16.10.B630

Dannenbring, 1977, An evaluation of flow-shop sequencing heuristics, Management Science, 23, 1174, 10.1287/mnsc.23.11.1174

Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117

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

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

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

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

Karg, 1964, A heuristic approach to solving travelling salesman problems, Management Science, 10, 225, 10.1287/mnsc.10.2.225

Lahiri, 1993, Evaluation of heuristics for scheduling in a flowshop: A case study, Production Planning and Control, 4, 153, 10.1080/09537289308919432

Maccarthy, 1993, Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling, International Journal of Production Research, 31, 59, 10.1080/00207549308956713

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

Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA, 11, 91, 10.1016/0305-0483(83)90088-9

Pinedo, 1995

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, 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

Rinnooy Kan, 1976

Szwarc, 1983, The flowshop problem with mean completion time criterion, IIETransactions, 15, 172

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

Turner, 1987, Comparison of heuristics for flow shop sequencing, OMEGA, 15, 75, 10.1016/0305-0483(87)90054-5