A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups
A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups
复制标题
DOI：
10.1016/s0360-8352(02)00002-5
复制
发表时间：
2002-04
影响因子：
7.9
通讯作者：
I. Choi;Dae-Sik Choi
中科院分区：
文献类型：
--
作者：
I. Choi;Dae-Sik Choi
替代操作顺序和顺序相关设置是经常出现在各种制造环境和项目调度中的两个重要因素。本文研究了同时考虑这些因素的车间调度问题。在它，一个混合整数规划模型的问题，沿着与本地搜索计划。局部搜索方案利用所识别的属性来减少计算时间。此外，一个属性，建立一个性能界限。使用基准数据的比较计算研究的结果表明，该计划显着提高了性能的几个贪婪为基础的调度规则所考虑的问题。
Alternative operation sequences and sequence-dependent setups are two important factors that frequently appear in various manufacturing environments and in project scheduling. This paper addresses a jobshop scheduling problem with these factors simultaneously considered. In it, a mixed integer program model of the problem is presented, along with a local search scheme. The local search scheme utilizes a property identified to reduce computation time. In addition, a property that establishes a performance bound is presented. Results from a comparative computational study using benchmark data show that the scheme significantly enhances the performance of several greedy-based dispatching rules for the problem under consideration.