期刊
JOURNAL OF INTELLIGENT MANUFACTURING
卷 21, 期 4, 页码 501-510出版社
SPRINGER
DOI: 10.1007/s10845-008-0207-0
关键词
Lotsizing and scheduling; Multi-product multi-level production; Sequence-dependent; MIP-based algorithm; Relax-and-fix
This paper discusses the multi-product multi-level capacitated lotsizing and scheduling problem with sequence-dependent setups. An exact formulation of the problem is provided as a mixed-integer program which is impractical to solve in reasonable computing time for non-small instances. To solve non-small instances of the problem, MIP-based heuristics are provided. To test the accuracy of heuristics, two lower bounds are developed and compared against the optimal solution. The trade-offs between schedule quality and computational time of heuristics are also provided.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据