An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging |
| |
Authors: | Tao Wu Leyuan Shi Joseph GeunesKerem Akartunal? |
| |
Affiliation: | a Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA b Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA c Department of Management Science, University of Strathclyde, Glasgow G1 1QE, UK d Department of Industrial Engineering and Management, Peking University, Beijing 100871, China |
| |
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. |
| |
Keywords: | Capacitated Multi-level Lot-sizing Backlogging Lower and upper bound guided nested partitions |
本文献已被 ScienceDirect 等数据库收录! |
|