Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows
成果类型：
Article
署名作者：
Stadtler, H
署名单位：
Technical University of Darmstadt
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.51.3.487.14949
发表日期：
2003
页码：
487-502
关键词：
摘要：
In this paper a new time-oriented decomposition heuristic is proposed to solve the dynamic multi-item multilevel lot-sizing problem in general product structures with single and multiple constrained resources as well as setup times. While lot-sizing decisions are made sequentially within an internally rolling planning interval (or lot-sizing window), capacities are always considered over the entire planning horizon. For each submodel a model formulation based on the Simple Plant Location representation is developed. These mixed-integer linear submodels are solved by standard mathematical programming software even for relatively large test instances. Extensive computational tests show that the heuristic proposed provides a better solution quality than a well-known special purpose heuristic.