• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >Multi-cut Benders decomposition approach to collaborative scheduling
【24h】

Multi-cut Benders decomposition approach to collaborative scheduling

机译：协同调度的多割Benders分解方法

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

摘要

This paper considers the scheduling of jobs with deadlines across a distributed production network involving cost minimisation among distributed factories with parallel machines. This problem has two sub-problems: (1) assigning a job to an appropriate factory according to the four features, namely the original factory of jobs that ordered it, transportation time between different factories, speed of machines and production costs in each factory, and (2) scheduling jobs in each factory. With respect to such property, the problem can be decomposed into an assignment and single factory scheduling sub-problems. The proposed approach first formulates the problem as a mixed integer linear program and then reformulates it using a Benders decomposition (BD) approach as an assignment sub-problem and as a single factory scheduling sub-problem. Since it is assumed that each job has its factory that initially ordered to it, for better balancing of the jobs completion times according to the speed and cost of each factory, jobs can be shifted between factories. This movement has a transportation time which is explicitly considered and integrated in a proposed model. To show that the BD-based approach is computationally powerful exact solution algorithm and is capable to solve medium-size problems, the performance of the proposed algorithm is examined by applying it to several test problems.
机译：本文考虑在分布式生产网络中按截止日期进行作业调度，这涉及在具有并行机的分布式工厂之间实现成本最小化。这个问题有两个子问题：（1）根据四个特征将工作分配给合适的工厂，即订购该工作的原始工厂，不同工厂之间的运输时间，机器速度和每个工厂的生产成本， （2）安排每个工厂的工作。关于这种性质，该问题可以分解为分配和单个工厂调度子问题。所提出的方法首先将该问题表示为混合整数线性程序，然后使用Benders分解（BD）方法将其重新分配为分配子问题和作为单个工厂调度子问题。因为假定每个作业都有其最初下达的工厂，所以为了根据每个工厂的速度和成本更好地平衡作业完成时间，可以在各个工厂之间转移作业。该运动具有明确考虑并集成在建议模型中的运输时间。为了证明基于BD的方法是计算能力强的精确求解算法，并且能够解决中等大小的问题，通过将其应用于几个测试问题来检验该算法的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号