Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481121 | European Journal of Operational Research | 2009 | 16 Pages |
Abstract
Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Kerem Akartunalı, Andrew J. Miller,