首页> 外文会议>New Frontiers in Applied Artificial Intelligence >Match-Up Strategies for Job Shop Rescheduling
【24h】

Match-Up Strategies for Job Shop Rescheduling

机译:作业车间重新安排的匹配策略

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

摘要

We investigate the problem of integrating new rush orders into the current schedule of a real world job shop floor. Satisfactory rescheduling methods must keep stability of the shop, by introducing the fewest number of changes in the ordering of operations, while maintaining the same levels of the schedule performance criteria. This paper introduces a number of match-up strategies that modify only part of the schedule in order to accommodate new arriving jobs. These strategies are compared with the right-shift and the total-rescheduling methods, which are optimal regarding stability and performance, but ineffective for performance and stability, respectively. Statistical analysis indicates that the match-up strategies are comparable to right-shift for stability, and as good as total-rescheduling for performance.
机译:我们研究了将新的紧急订单整合到现实世界车间当前时间表中的问题。令人满意的重新计划方法必须通过在操作顺序中引入最少数量的更改来保持车间的稳定性,同时保持相同水平的计划绩效标准。本文介绍了一些匹配策略,这些策略仅修改了部分进度表以适应新来的工作。将这些策略与右移和总调度方法进行了比较,这两种方法在稳定性和性能方面是最佳的,但对性能和稳定性分别无效。统计分析表明,匹配策略的稳定性可与右移媲美,而性能则可与整体重新安排相媲美。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号