An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

Baker, 1974

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

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

French, 1982

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

Gelders, 1978, Four simple heuristics for scheduling a flow shop, International Journal of Production Research, 16, 221, 10.1080/00207547808930015

1993, 41

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

Hundal, 1988, An extension of Palmer's heuristic for the flowshop scheduling problem, International Journal of Production Research, 26, 1119, 10.1080/00207548808947922

Ignall, 1965, Application of the branch-and-bound technique to some flowshop scheduling problems, Operations Research, 13, 400, 10.1287/opre.13.3.400

Ishibuchi, 1995, Modified simulated annealing algorithms for the flow shop sequencing problems, European Journal of Operational Research, 81, 388, 10.1016/0377-2217(93)E0235-P

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

King, 1980, Heuristics for flowshop scheduling, International Journal of Production Research, 18, 345, 10.1080/00207548008919673

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

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

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

Ogbu, 1990, The application of the simulated annealing algorithm to the solution of the nmCmax flowshop problem, Computers and Operations Research, 17, 243, 10.1016/0305-0548(90)90001-N

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

Stinson, 1982, A heuristic programming procedure for sequencing the static flowshop, International Journal of Production Research, 20, 753, 10.1080/00207548208947802

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

Widmer, 1989, A new heuristic method for the flowshop sequencing problem, European Journal of Operational Research, 41, 186, 10.1016/0377-2217(89)90383-4