论文部分内容阅读
转换(启动)时间是工业中带有清洗、更换物料工序的生产过程所需要的,该时间一般很大程度上依赖于紧接工序.这种环境下的调度问题都是工件顺序依赖的.本文研究顺序依赖的单机总权重拖期调度问题,为NP难的组合优化问题.针对该问题.提出了一种迭代的过滤-扇出算法(IFF).算法以分支树的结构形式在解空间中搜索.在算法中.当分支移动不能改进根节点时,重新产生有继承性的根节点,使得算法继续进行.根据问题特性,提出了带序列片段重组和参考局部搜索的分支移动策略,获得分支节点.对文献中的120组数据的算法测试结果表明:对大多数实例.IFF算法的计算结果优于或不劣于DE算法和DPSO算法的计算结果,同时改进了42个实例的最好解.
The conversion (start-up) time is required in the production process in the industry with the steps of cleaning and changing the material, and the time is generally very much dependent on the next process, in which the scheduling problems are all order dependent. In this paper, an iterative filter-fanout algorithm (IFF) is proposed to solve this problem, which is a NP-hard combinatorial optimization problem.This algorithm takes the branch tree structure in the solution space In the algorithm, when the branch can not improve the root node, the regenerated root node is regenerated to make the algorithm continue.According to the characteristics of the problem, a branch moving strategy with sequence fragment reorganization and reference local search is proposed, and the branch Node.Analysis of the test results of 120 data sets in the literature shows that for most of the cases, the result of the algorithm of the .IFF algorithm is better than or worse than the result of the DE algorithm and the DPSO algorithm, meanwhile, the best solution of 42 examples is improved .