Heuristic Algorithm Based on Critical Machine for No-wait Flow-shop Scheduling

No-wait flow shops are characterized as the continuity of job in processing,once it begins,and subsequent processing must be carried out with no delay in the passage of the job from machine to machine.Addressing the problem with objective of makespan,a constructive heuristic algorithm was proposed based on the critical machine and the insertion method.Computational results and comparisons with three heuristics in the literature based on benchmarks demonstrated the effectiveness of the proposed algorithm.