A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
Year of publication: |
1991
|
---|---|
Authors: | Federgruen, Awi ; Tzur, Michal |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 37.1991, 8, p. 909-925
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | dynamic lot sizing models | dynamic programming | complexity |
-
Operations scheduling under electricity time-varying prices
Mikhaylidi, Yevgenia, (2015)
-
Solving multi-agent scheduling problems on parallel machines with a global objective function
Sadi, Faiza, (2014)
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
- More ...
-
Federgruen, Awi, (1994)
-
Federgruen, Awi, (1994)
-
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
Federgruen, Awi, (2002)
- More ...