HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP

We present two simple heuristic algorithms for scheduling to minimize makespan in the constrained (or no-wait) flowshop. While developing th e heuristics, we 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 s izes, the solutions yielded by the proposed heuristic algorithms are f ound to be reasonably accurate, and superior to the ones given by the existing heuristics.