【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.
机译:我们调查将新的Rush命令纳入现实世界工作车间的当前日程表。令人满意的重新安排方法必须通过引入运营顺序的最少的变化,同时保持相同水分绩效标准的持续变化,令人满意的重新安排方法必须保持稳定性。本文介绍了许多匹配策略,以便仅修改部分时间表,以适应新的到达工作。将这些策略与右转和总重新安排方法进行比较,这对于稳定性和性能以及性能和稳定性无效。统计分析表明,匹配策略与稳定性的右转相当,并且尽可能地重新安排性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号