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...
मुख्य लेखकों: | Leung, Janny M. Y., Magnanti, Thomas L., Vachani, Rita |
---|---|
स्वरूप: | Working Paper |
भाषा: | en_US |
प्रकाशित: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
ऑनलाइन पहुंच: | http://hdl.handle.net/1721.1/5210 |
समान संसाधन
-
Valid Inequalities and Facets of the Capacitated Plant Location Problem
द्वारा: Leung, Janny M. Y., और अन्य
प्रकाशित: (2004) -
Modeling and Solving the Capacitated Network Loading Problem
द्वारा: Magnanti, Thomas L., और अन्य
प्रकाशित: (2004) -
The Convex Hull of Two Core Capacitated Network Design Problems
द्वारा: Magnanti, Thomas L., और अन्य
प्रकाशित: (2004) -
The capacitated lot size problems
द्वारा: Matsuo, Hirofumi.
प्रकाशित: (2024) -
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
द्वारा: Magnanti, Thomas L., और अन्य
प्रकाशित: (2004)