论文标题
关于未竞争的多植物批量问题的计算复杂性
On the computational complexity of uncapacitated multi-plant lot-sizing problems
论文作者
论文摘要
当今竞争性的工业和商业领域，生产和库存计划已变得至关重要和具有挑战性，尤其是在涉及多个工厂或仓库的情况下。在这种情况下，本文讨论了无竞争的多植物批量问题的复杂性。我们考虑了一个多项目不受影响的多植物批次大小问题，并表明其两个非常受限制的特殊情况已经是NP-HARD。也就是说，我们表明，单个时期的单项非容险的多植物批量大小的问题，以及固定转移成本的多项目不受竞争的两型式批次大小问题是NP-HARD。此外，作为该验证结果的直接含义，我们还表明，两次隔离的多项目大小，以及交通运输的联合设置成本是NP-HARD。
Production and inventory planning have become crucial and challenging in nowadays competitive industrial and commercial sectors, especially when multiple plants or warehouses are involved. In this context, this paper addresses the complexity of uncapacitated multi-plant lot-sizing problems. We consider a multi-item uncapacitated multi-plant lot-sizing problem with fixed transfer costs and show that two of its very restricted special cases are already NP-hard. Namely, we show that the single-item uncapacitated multi-plant lot-sizing problem with a single period and the multi-item uncapacitated two-plant lot-sizing problem with fixed transfer costs are NP-hard. Furthermore, as a direct implication of the proven results, we also show that a two-echelon multi-item lot-sizing with joint setup costs on transportation is NP-hard.
