...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
【24h】

Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times

机译：具有固定处理时间的提升机和多种零件的最佳循环调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper proposes an exact algorithm to solve a cyclic hoist scheduling problem in a printed circuit board (PCB) electroplating facility, where multi-type parts with fixed processing times are processed in the same time and the parts are not allowed to wait in the tanks or on the hoist. Finding an optimal schedule in such a production line is equivalent to finding two types of related sequences: part input sequence and hoist move sequence. We show that the entering times of the parts are the decision variables of the problem. We formulate our problem using the notion of prohibited intervals and solve it by enumerating the non-prohibited intervals of the decision variables. This enumeration is accomplished more efficiently with a dynamic branch and bound procedure, which utilises relaxed solutions to eliminate redundant non-prohibited intervals in the search process. The proposed algorithm is polynomial in the number of tanks if the number of part types is fixed, but exponential if it is arbitrary. Computational results on randomly generated test instances indicate that the algorithm is effective.
机译：本文提出了一种精确的算法来解决印刷电路板（PCB）电镀设施中的循环葫芦调度问题，在该过程中，要同时处理具有固定处理时间的多种类型的零件，并且不允许零件在罐中等待或在葫芦上。在这样的生产线中找到最佳进度计划等同于找到两种类型的相关序列：零件输入序列和提升机移动序列。我们证明了零件的输入时间是问题的决策变量。我们使用禁止间隔的概念来表达我们的问题，并通过枚举决策变量的非禁止间隔来解决它。通过动态分支定界过程可以更有效地完成此枚举，该过程利用宽松的解决方案来消除搜索过程中多余的非禁止间隔。如果零件类型的数量是固定的，则所提出的算法是坦克数量的多项式，如果是任意的，则是指数函数。随机生成的测试实例的计算结果表明该算法是有效的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号