An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions. 2011 Elsevier B.V. All rights reserved.
