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)