A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan

Abstract

The scheduling problem in the no-wait or constrained flowshop, with the makespan objective, is considered in this article. A simple heuristic algorithm is proposed on the basis of heuristic preference relations and job insertion. When evaluated over a large number of problems of various sizes, the solutions given by the proposed heuristic are found to be fairly accurate and much superior to those given by the two existing heuristics.