A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Ashour, 1970, An experimental investigation and comparative evaluation of flow-shop scheduling techniques, Ops Res., 18, 10.1287/opre.18.3.541 Baker, 1974 Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Mgmt Sci., 16 Conway, 1967 Dannenbring, 1977, An evaluation of flow-shop sequencing heuristics, Mgmt Sci., 23, 10.1287/mnsc.23.11.1174 Dudek, 1964, Development of M stage decision rule for scheduling ‘n’ jobs through ‘m’ machines, Ops Res., 12, 10.1287/opre.12.3.471 Gupta, 1971, A functional heuristic algorithm for the flow-shop scheduling problem, Op. Res. Q., 22, 10.1057/jors.1971.18 Ignall, 1965, Application of the branch and bound technique to some flow shop scheduling problems, Ops Res., 13, 10.1287/opre.13.3.400 Johnson, 1954, Optimal two and three-stage production schedules with set-up times included, Naval Res. Logistic Q., 1, 10.1002/nav.3800010110 Lomnicki, 1965, A branch and bound algorithm for the exact solution of the three-machine scheduling problem, Op. Res. Q., 16, 10.1057/jors.1965.7 Nawaz, 1980, nxm flow shop sequencing and scheduling problem Palmer, 1965, Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum, Op. Res. Q., 16, 10.1057/jors.1965.8 Park, 1981, A simulation study and an analysis for evaluation of performance-effectiveness of flowshop sequencing heuristics: a static and a dynamic flowshop model Petrov, 1966 Setiaputra, 1980, A survey of flow-shop permutation scheduling techniques and an evaluation of heuristic's solution methods