Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters - Tập 8 Số 2 - Trang 61-66 - 1989
Esther M. Arkin1, Dev Joneja1, R. Roundy1
1School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

Bitran, 1982, Computational complexity of capacitated lot sizing problem, Management Science, 28, 1174, 10.1287/mnsc.28.10.1174

Florian, 1980, Deterministic production planning: Algorithms and complexity, Management Science, 26, 669, 10.1287/mnsc.26.7.669

Garey, 1979

Kao, 1979, A multi-product dynamic lot size model with individual and joint setup costs, Operations Res., 26, 279, 10.1287/opre.27.2.279

Love, 1971, A facilities in series inventory model with nested schedules, Management Science, 18, 327, 10.1287/mnsc.18.5.327

Rajagopalan, 1988, Dynamic lot size models in multi stage assembly systems

Schwarz, 1973, A simple continuous review deterministic one-warehouse N-retailer inventory problem, Management Science, 19, 555, 10.1287/mnsc.19.5.555

Veinott, 1969, Minimum concave cost solutions of Leontief substitution models of multi-facility inventory systems, Operations Res., 17, 262, 10.1287/opre.17.2.262

Wagner, 1958, Dynamic version of the economic lot size model, Management Science, 5/1, 89, 10.1287/mnsc.5.1.89

Zangwill, 1966, A deterministic multi-product multi-facility production and inventory model, Operations Res., 14, 486, 10.1287/opre.14.3.486