基于工件间距离的无等待流程车间调度构造启发式算法  

Heuristic Algorithm Based on Distance between Jobs for No-wait Flow-shop Scheduling

作　　者：洪宗友[1] 庞哈利[2] 

机构地区：[1]沈阳化工学院数理系,辽宁沈阳110142 [2]东北大学系统工程研究所,辽宁沈阳110006

出　　处：《沈阳化工学院学报》2008年第4期350-354,共5页Journal of Shenyang Institute of Chemical Technolgy

基　　金：国家自然科学基金(70431003);辽宁省自然科学基金(20032024);沈阳市自然科学基金(10411006-1-03-04)

摘　　要：无等待(No-wait)流程车间调度问题要求每个工件从加工开始至结束,必须连续进行,不允许其在完成某一工序后滞留在任一机器上.基于对目标函数的结构分析,提出一种基于最小化工件间距离的初始排序策略,结合插入方法的启发式算法.通过与文献中的启发式算法在对大量典型算例的比较后,实验数据验证了提出的算法在解的质量上超越了其它算法.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 based on the distance of jobs and the insertion method was proposed in this article for No-wait flow-shop scheduling with objective of makespan. Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm than other heuristic algorithms.

关 键 词：流程车间 调度 启发式算法 无等待 

分 类 号：O223[理学—运筹学与控制论]