Blocking流水车间调度问题的MBT算法研究

被引：2

作者：

洪宗友 ^{[1
]}

闫萍 ^{[1
]}

庞哈利 ^{[2
]}

机构：

[1] 沈阳化工学院数理系

[2] 东北大学信息科学与工程学院

来源：

关键词：

流水车间调度; 启发式算法; Blocking流水车间;

D O I：

暂无

中图分类号：

O223 [统筹方法];

学科分类号：

摘要：

针对目标函数为Makespan的Blocking流水车间调度问题,设计了一种构造启发式算法.初始排序的产生从减少下游工件的滞留时间入手,结合有向图中对关键路径的分析,采用插入规则进行搜索的方法得到工件序列的近优排序.通过大量典型算例的计算,实验结果证明了设计的算法具有优越的性能.

引用

页码：148 / 151

页数：4

共 9 条

[1] Benchmarks for basic scheduling problems. TAILLARD E D. European Journal of Operational Research . 1993
[2] Opti mal Planning of Parts Machining on a Number of Mmachines. LEVENER E V. Automation and Remote Control . 1969
[3] Anote on const ructive heuristics for the flowshop problem with blocking. RONCONI D P. International Journal of ProductionEconomics . 2004
[4] Aheuristic algorithmfor the m-machine n-job flowshop sequencing problem. NAWAZ M,ENSCORE E E,HamI. OMEGA,International Journal of Management Science . 1983
[5] Lower bounding schemes for flowshops with blocking in-process. RONCONI D P,ARMENTANO V A. Journal of the Opera-tional Research Society . 2001
[6] Sequencingin an assemblyline with blockingto mini mize cycle ti me. MCCORMICKS T,PI NEDO ML,Shenker S,et al. Oper-ations Research . 1989
[7] Asurvey of machine scheduling problems with blocking and no-wait in process. HALL N G,SRISKANDARAJAH C. Operations Research . 1996
[8] Flowshop sequencing problems with li mited buffer storage. LEISTEN R. International Journal of Production Research . 1990
[9] Ani mplicit enumeration scheme for the flowshop problem with nointermediate storage. SUHAMI I,MAH R S H. Computersand Chemical Engineering . 1981