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...
Asıl Yazarlar: | Leung, Janny M. Y., Magnanti, Thomas L., Vachani, Rita |
---|---|
Materyal Türü: | Working Paper |
Dil: | en_US |
Baskı/Yayın Bilgisi: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Erişim: | http://hdl.handle.net/1721.1/5210 |
Benzer Materyaller
-
Valid Inequalities and Facets of the Capacitated Plant Location Problem
Yazar:: Leung, Janny M. Y., ve diğerleri
Baskı/Yayın Bilgisi: (2004) -
Modeling and Solving the Capacitated Network Loading Problem
Yazar:: Magnanti, Thomas L., ve diğerleri
Baskı/Yayın Bilgisi: (2004) -
The Convex Hull of Two Core Capacitated Network Design Problems
Yazar:: Magnanti, Thomas L., ve diğerleri
Baskı/Yayın Bilgisi: (2004) -
The capacitated lot size problems
Yazar:: Matsuo, Hirofumi.
Baskı/Yayın Bilgisi: (2024) -
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
Yazar:: Magnanti, Thomas L., ve diğerleri
Baskı/Yayın Bilgisi: (2004)