大规模无等待流水调度问题的邻域迭代搜索算法-控制与决策.pdfVIP

第26 卷 第4 期 控 制 与 决 策 2011 年 4 月 Vol. 26 No. 4 Control and Decision Apr. 2011 文章编号: 1001-0920 (2011) 04-0535-05 大规模无等待流水调度问题的邻域迭代搜索算法 1a,2 1b 1a 宋存利 , 刘晓冰 , 王 伟 (1. 大连理工大学a. 电子与信息工程学院，b. 管理学院，辽宁 大连116024；2. 大连交通大学软件学院，辽宁大连116052) 摘 要: 在分析大规模无等待流水调度问题特点的基础上, 提出了利用相邻工件间完工时间距离求最小化完工时间 的方法; 通过研究工件插入和工件对的交换对最小化完工时间的影响, 提出一种邻域迭代搜索算法, 该算法降低了求 解完工时间的时间复杂度, 大大提高了算法效率; 为避免算法在邻域搜索过程中陷入局部最优, 将变邻域结构算法的 思想应用于其中. 仿真结果表明, 所提出的算法能高效率解决大规模无等待流水调度问题, 所得结果令人满意. 关键词: 邻域迭代搜索算法；无等待流水调度；最小化完工时间 中图分类号: TP301 文献标识码: A An iterative neighborhood search algorithm for large scale no-wait flow- shop SONG Cun-li1a,2 , LIU Xiao-bing1b, WANG Wei1a (1a. School of Electronic and Information Engineering，1b. College of Management，Dalian University of Technology, Dalian 116024 ，China ；2. Software Institute，Dalian Jiaotong University ，Dalian 116052 ，China. Correspondent: SONG Cun-li，E-mail ：scunli@163.com) Abstract: According the characteristic of large-scale no-wait flow shop, a method for calculating makespan is proposed for large-scale no-wait flow shop scheduling by using the distance of adjacent workpiece. At the same time, an iterative neighborhood search algorithm is proposed, which reduces the time complexity, so the efficiency is greatly improved. In order to avoid falling into local optimum, the mind of variable neighborhood search algorithm is used, so that the probability to finding the global optimal solution is enhanced. Experiment results show that the algorithm can solve the problem of large-scale no-wait flow-shop scheduling efficiently, and the result is better. Key words: iterative nei