Facets and algorithms for capacitated lot sizing |
| |
Authors: | Janny M. Y. Leung Thomas L. Magnanti Rita Vachani |
| |
Affiliation: | (1) Operations Research Department, Yale University, 06520 New Haven, CT, USA;(2) Sloan School of Management, MIT, 02139 Cambridge, MA, USA;(3) GTE Laboratories, 02254 Waltham, MA, USA |
| |
Abstract: | The dynamic economic lot sizing model, which lies at the core of numerous production planning applications, is one of the most highly studied models in all of operations research. And yet, capacitated multi-item versions of this problem remain computationally elusive. We study the polyhedral structure of an integer programming formulation of a single-item capacitated version of this problem, and use these results to develop solution methods for multi-item applications. In particular, we introduce a set of valid inequalities for the problem and show that they define facets of the underlying integer programming polyhedron. Computational results on several single and multiple product examples show that these inequalities can be used quite effectively to develop an efficient cutting plane/branch and bound procedure. Moreover, our results show that in many instances adding certain of these inequalities a priori to the problem formulation, and avoiding the generation of cutting planes, can be equally effective.Supported by Grant #ECS-8316224 from the Systems Theory and Operations Research Program of the National Science Foundation. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|