...
首页> 外文期刊>Journal of Scheduling >Capacitated lot-sizing and scheduling with sequence-dependent,period-overlapping and non-triangular setups
【24h】

Capacitated lot-sizing and scheduling with sequence-dependent,period-overlapping and non-triangular setups

机译:通过与序列有关的,周期性的重叠和非三角设置来进行批量分配和排班

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

获取外文期刊封面封底 >>

       

摘要

In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period-in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed-integer programming extension for the capacitated lot-sizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lot-sizing and scheduling models.
机译:在生产计划中,从一种产品到另一种产品的转换通常会产生与序列有关的设置时间和成本。如果准备时间和成本不考虑三角不等式,则可能会出现这样的情况:最佳解决方案在一个时期内包含多于一个批次的同一产品;换句话说,该产品的生产顺序中至少存在一个子巡回期。通过允许设置交叉,可以增加灵活性并找到更好的解决方案。在容量紧张的情况下,或每当设置时间很长时,都需要进行设置交叉以确保可行性。我们提出了第一个线性混合整数编程扩展程序,用于容量化的批量确定和调度问题,其中包含了序列子巡视和设置交叉的所有必要功能。此公式比其他众所周知的批量大小和调度模型更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号