Facets and Algorithms for Capacitated Lot Sizing
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 structu...
Autori principali: | Leung, Janny M. Y., Magnanti, Thomas L., Vachani, Rita |
---|---|
Natura: | Working Paper |
Lingua: | en_US |
Pubblicazione: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Accesso online: | http://hdl.handle.net/1721.1/5210 |
Documenti analoghi
Documenti analoghi
-
Valid Inequalities and Facets of the Capacitated Plant Location Problem
di: Leung, Janny M. Y., et al.
Pubblicazione: (2004) -
Modeling and Solving the Capacitated Network Loading Problem
di: Magnanti, Thomas L., et al.
Pubblicazione: (2004) -
The Convex Hull of Two Core Capacitated Network Design Problems
di: Magnanti, Thomas L., et al.
Pubblicazione: (2004) -
The capacitated lot size problems
di: Matsuo, Hirofumi.
Pubblicazione: (2024) -
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
di: Magnanti, Thomas L., et al.
Pubblicazione: (2004)