Heuristic algorithm for scheduling in a flowshop to minimize total flowtime

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

Lominicki, 1965, A branch-and-bound algorithm for the exact solution of the three machine scheduling problem, Oper. Res. Quarterly, 16, 89, 10.1057/jors.1965.7

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

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

King, 1980, Heuristics for flowshop scheduling, Int. J. Prod. Res., 18, 343, 10.1080/00207548008919673

Stinson, 1982, A heuristic programming procedure for sequencing the static flowshop, Int. J. Prod. Res., 20, 753, 10.1080/00207548208947802

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

Hundal, 1988, An extension of Palmer's heuristic for the flowshop scheduling problem, Int. J. Prod. Res., 26, 1119, 10.1080/00207548808947922

Ogbu, 1990, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Comp. Oper. Res., 17, 243, 10.1016/0305-0548(90)90001-N

Osman, 1989, Simulated Annealing for permutation flow-shop scheduling, OMEGA, 17, 551, 10.1016/0305-0483(89)90059-5

Bansal, 1977, Minimizing the sum of completion times of n-jobs over m-machines in a flowshop, AIIE Trans., 9, 306, 10.1080/05695557708975160

Szwarc, 1983, The flow-shop problem with mean completion time criterion, IIE Trans., 15, 172, 10.1080/05695558308974629

Gupta, 1972, Heuristic algorithms for multi-stage flowshop scheduling problem, AIIE Trans., 4, 11, 10.1080/05695557208974823

Miyazaki, 1978, An adjacent pairwise approach to the mean flowtime scheduling problem, J. Oper. Res. Society Japan, 21, 287

Ho, 1991, A new heuristic for the n-job, m-machine flow-shop problem, Eur. J. Oper. Res., 52, 194, 10.1016/0377-2217(91)90080-F

Baker, 1974

French, 1982

Garey, 1976, The complexity of flowshop and Jobshop scheduling, Math. Oper. Res., 1, 117, 10.1287/moor.1.2.117

Smith, 1967, A general algorithm for the solution of the n-job, m-machine sequencing problem of the flowshop, Oper. Res., 15, 71, 10.1287/opre.15.1.71

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