Computational complexity of uncapacitated multi-echelon production planning problems
- 1 April 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (2) , 61-66
- https://doi.org/10.1016/0167-6377(89)90001-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Computational Complexity of the Capacitated Lot Size ProblemManagement Science, 1982
- Deterministic Production Planning: Algorithms and ComplexityManagement Science, 1980
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up CostsOperations Research, 1979
- A Simple Continuous Review Deterministic One-Warehouse N-Retailer Inventory ProblemManagement Science, 1973
- A Facilities in Series Inventory Model with Nested SchedulesManagement Science, 1972
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory SystemsOperations Research, 1969
- A Deterministic Multiproduct, Multi-Facility Production and Inventory ModelOperations Research, 1966
- Dynamic Version of the Economic Lot Size ModelManagement Science, 1958