Heuristic Algorithm Based on the Crucial Machine for the No-Wait Flow-Shop Scheduling
No-Wait flow shops characterized as the continuity of job in processing, once it begins, 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 in this article that based on the properties of the Crucial Machine and the job insertion method. Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm.
Scheduling Flow Shop Heuristic No-Wait
HONG Zong-you PANG Ha-li
Department of Science,Shenyang Institute of Chemical Technology,Shenyang 110142 Institute of Systems Engineering,Northeastern University,Shenyang 110006
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
5121-5124
2009-06-17(万方平台首次上网日期,不代表论文的发表时间)