论文信息 - Computational complexity of uncapacitated multi-echelon production planning problems - 字舞流文

Computational complexity of uncapacitated multi-echelon production planning problems

E. Arkin | R. Roundy | D. Joneja

[1] Willard I. Zangwill,et al. A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..

[2] Arthur F. Veinott,et al. Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[3] Stephen F. Love. A Facilities in Series Inventory Model with Nested Schedules , 1972 .

[4] Leroy B. Schwarz,et al. A Simple Continuous Review Deterministic One-Warehouse N-Retailer Inventory Problem , 1973 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Edward P. C. Kao,et al. A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs , 1979, Oper. Res..

[7] J. K. Lenstra,et al. Deterministic Production Planning: Algorithms and Complexity , 1980 .

[8] G. Bitran,et al. Computational Complexity of the Capacitated Lot Size Problem , 1982 .