Polynomial dynamic programming algorithms for lot sizing models with bounded inventory and stockout and/or backlogging
- 7 July 2015
- journal article
- Published by Springer Nature in Journal of Systems Science and Systems Engineering
- Vol. 25 (3) , 370-397
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost salesInternational Journal of Production Research, 2011
- An algorithm for lot sizing with inventory bounds and fixed costsOperations Research Letters, 2008
- Loss of customer goodwill in the uncapacitated lot-sizing problemComputers & Operations Research, 2007
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and ComputationOperations Research, 2005
- The single-item lot-sizing problem with immediate lost salesEuropean Journal of Operational Research, 2003
- Capacity Acquisition, Subcontracting, and Lot SizingManagement Science, 2001
- Improved Algorithms for Economic Lot Size ProblemsOperations Research, 1993
- Computational Complexity of the Capacitated Lot Size ProblemManagement Science, 1982
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity ConstraintsManagement Science, 1978
- Planning Horizons for the Dynamic Lot Size Model with BackloggingManagement Science, 1974