arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.00201math.OC
收藏

具有切换费用的少量产品高重数排序问题

High Multiplicity Scheduling with Switching Costs for few Products

Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk

摘要:

本文研究了单机容量受限的批量生产问题的一个变形,该问题具有序列相关的设置成本和产品相关的库存成本。我们给定一台机器和一组产品,这些产品与恒定的需求率、最大装载率和单位时间的持有成本相关联。将生产从一种产品切换到另一种产品会产生基于两种产品的测序成本。在这项工作中,我们表明,通过考虑高的多重性设置和切换成本,即使是平凡的情况下,相应的“正常”的同行变得不平凡的大小和复杂性。我们提供一种和两种产品的解决方案。

英文摘要:

We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and a set of products associated with a constant demand rate, maximum loading rate and holding costs per time unit. Switching production from one product to another incurs sequencing costs based on the two products. In this work, we show that by considering the high multiplicity setting and switching costs, even trivial cases of the corresponding "normal" counterparts become non-trivial in terms of size and complexity. We present solutions for one and two products.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑