Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
Year of publication: |
1989
|
---|---|
Authors: | Roundy, Robin |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 35.1989, 12, p. 1433-1442
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | production planning | lot sizing: heuristics | capacity constraints |
-
An O(Tˆ3) algorithm for the capacitated lot sizing problem with minimum order quantities
Okhrin, Irena, (2010)
-
Managing production-inventory systems with scarce resources
Benjaafar, Saif, (2017)
-
Cyclical Schedules for Capacitated Lot Sizing with Dynamic Demands
Campbell, Gerard M., (1991)
- More ...
-
A constant approximation algorithm for the one-warehouse multiretailer problem
Levi, Retsef, (2008)
-
New sufficient conditions for (s, S) policies to be optimal in systems with multiple uncertainties
Chen, Lucy Gongtao, (2015)
-
Inventory control under financial turbulence
Chen, Lucy Gongtao, (2016)
- More ...