交货期窗口下的并行机调度问题的遗传算法  

Genetic algorithm for parallel machine scheduling with due windows

作　　者：王莉[1] 李大卫[2] 王梦光[3] 

机构地区：[1]鞍山师范学院,鞍山114005 [2]鞍山钢铁学院数理系,鞍山114002 [3]东北大学系统工程研究所,沈阳110006

出　　处：《系统工程学报》2002年第1期45-49,55,共6页Journal of Systems Engineering

基　　金：辽宁省教委科研基金资助项目 ( 982 742 1189)

摘　　要：给出了一种求解不同交货期窗口的并行机调度问题的混合遗传算法 ,根据问题的特征采用扩展排列编码方式表示工件的分配和排列 .利用给出的调度优先级规则和最好适应值规则相结合的启发式算法对每台机器上工件的顺序进行调整 .In this paper a hybrid genetic algorithm for solving the parallel machine scheduling problem with different due windows is proposed. An extended permutation-coding scheme is used to represent job partition and job permutation based on the problem characteristics. A heuristic from combining priority rule with best-fit rule is given to adjust the jobs sequence on each machine. The experiment results show that the algorithm is effective.

关 键 词：交货期窗口 遗传算法 并行机调度问题 启发式算法 

分 类 号：O242.23[理学—计算数学]