...
首页> 外文期刊>Journal of Combinatorial Optimization >The flexible blocking job shop with transfer and set-up times
【24h】

The flexible blocking job shop with transfer and set-up times

机译:具有转移和设置时间的灵活的阻塞式作业车间

获取原文
获取原文并翻译 | 示例
           

摘要

The Flexible Blocking Job Shop (FBJS) considered here is a job shop scheduling problem characterized by the availability of alternative machines for each operation and the absence of buffers. The latter implies that a job, after completing an operation, has to remain on the machine until its next operation starts. Additional features are sequence-dependent transfer and set-up times, the first for passing a job from a machine to the next, the second for change-over on a machine from an operation to the next. The objective is to assign machines and schedule the operations in order to minimize the makespan. We give a problem formulation in a disjunctive graph and develop a heuristic local search approach. A feasible neighborhood is constructed, where typically a critical operation is moved (keeping or changing its machine) together with some other operations whose moves are “implied”. For this purpose, we develop the theoretical framework of job insertion with local flexibility, based on earlier work of Gröflin and Klinkert on insertion. A tabu search that consistently generates feasible neighbor solutions is then proposed and tested on a larger test set. Numerical results support the validity of our approach and establish first benchmarks for the FBJS.
机译:这里考虑的灵活块作业车间(FBJS)是一个作业车间调度问题,其特征是每个操作都具有备用机器,并且没有缓冲区。后者意味着作业完成后,必须保留在机器上,直到下一次操作开始为止。其他功能是与序列有关的传输和建立时间,第一个功能用于将作业从机器传递到下一个,第二个功能用于在机器上从操作转换到下一个。目的是分配机器并安排作业时间,以最大程度地缩短工期。我们在析取图中给出问题表述,并开发一种启发式的局部搜索方法。构建一个可行的邻域,在该邻域中,通常将关键操作(保留或更改其机器)与其他一些“暗示”了这些操作的操作一起移动。为此,我们在Gröflin和Klinkert的早期工作基础上,开发了具有局部灵活性的工作插入的理论框架。然后提出一种禁忌搜索,该搜索始终生成可行的邻域解,并在更大的测试集上进行测试。数值结果证明了我们方法的有效性,并为FBJS建立了第一个基准。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号