Heuristic algorithms for scheduling in the no-wait flowshop

The authors present two simple heuristic algorithms for scheduling to minimize makespan in the constrained (or no-wait) flowshop. While developing the heuristics, they first present the methods to obtain the initial seed sequences, and subsequently obtain better solutions by an improvement technique. When evaluated over a large number of problems of various sizes, the solutions yielded by the proposed heuristic algorithms are found to be reasonably accurate, and superior to the ones given by the existing heuristics.