2求解NPS调度方案的局部搜索算法.doc

PAGE 5 机 械 工 程 学 报 第39卷第2期期 PAGE 5  PAGE 5  MACROBUTTON MTEditEquationSection2 方程段 1 节 1 SEQ MTEqn \r \h \* MERGEFORMAT  SEQ MTSec \r 1 \h \* MERGEFORMAT  SEQ MTChap \r 1 \h \* MERGEFORMAT 基于流水线调度问题的模型与局部搜索算法 郭盈 刘心报 （合肥工业大学管理学院 合肥 230009） 摘要：在基于流水线的调度问题中，所有工件按照相同的顺序访问机器，但部分或全部工件可以不必在某些机器上进行加工。标准flowshop问题是这种流水线调度问题的一个特例。研究了带序依赖和机器依赖加工准备时间的流水线调度问题，针对该问题建立了一个基于序列的0-1混合整数规划模型，目标函数是总加权完工时间最小，提出了相应的局部搜索算法，实验结果证明了算法的有效性和可应用性，所提出的局部搜索算法的求解思路对同类流水线调度问题具有指导意义。 关键字：流水线调度 工序跳跃 总加权完工时间 加工准备时间 局部搜索 非置换方案 中图分类号：F273 文献标识码：A Model and local search algorithm for the flowline scheduling problem with missing operations GUO Ying LIU Xinbao (School of Management, Hefei University of Technology, Hefei, Anhui Province,230009) Abstract: In the flowline scheduling problem with missing operations, all jobs visit a set of machines following a same and unidirectional route but some or all jobs can skip some machines. The standard flowshop problem is a special case of this type of flowline scheduling problem. This paper considers this type of flowline scheduling problem with the sequence and machine dependent setup times. For this problem, a mathematical model based on the job sequence is formulated by 0-1 mixed integer problem and the objective is to find the non-permutation schedules that minimize the total weighted completion times. A local search algorithm is present and computational results demonstrate the effectivity, efficiency and practicability of the new algorithm. The idea of the proposed algorithm be able to provide researchers and practitioners a suggest for other types of the flowline problems with missing operations. Keywords: flowline missing operations total weighted completion times setup times local search non-permutation 0 前言?本研究由“国家自然科学资金”资助。 第一作者：郭盈，女，1982年生，博士生，主要研究方向：生产调度， HYPERLINK mailto:carol.g@163.com carol.g@163.com； 通讯作者：刘心报，博士，教授，lxinbao@126.com. 经典flowshop问题，假设所有工件都必须按照完全相同的工艺路线在所有的机器上进行加工。而在实际的生产环境中，加工路线往往