The single-item lot-sizing problem with immediate lost sales

European Journal of Operational Research

Volumn 147, Issue 3, 2003, Pages 558-566

  Aksen, Deniz ^a   Altinkemer, Kemal ^a   Chand, Suresh ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Conservation period; Dynamic programming; Lot sizing; Profit

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; INDUSTRIAL MANAGEMENT; PROBLEM SOLVING; SALES;

LOT SIZING;

OPERATIONS RESEARCH;

EID: 0037449224     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00331-4     Document Type: Article

References (8)

1. Gupta S.M., Brennan L. Heuristic and optimal approaches to lot-sizing incorporating backorders: An empirical evaluation. International Journal of Production Research. 30(12):1992;2813-2824.
2. Kuik R., Salomon M., Wassenhove L.N. Batching decisions: Structure and models. European Journal of Operational Research. 75(2):1994;243-263.
3. Maes J., Wassenhove L.N. Multi-item single-level capacitated lot-sizing heuristics: A general review. Journal of Operational Research Society. 39(11):1988;991-1004.
4. Sandbothe R.A., Thompson G.L. A forward algorithm for the capacitated lot size model with stockouts. Operations Research. 38(3):1990;474-486.
5. Sandbothe R.A., Thompson G.L. Decision horizons for the capacitated lot size model with inventory bounds and stockouts. Computers and Operations Research. 20(5):1993;455-465.
6. Wagner H.M., Whitin T. Dynamic version of the economic lot size model. Management Science. 5:1958;89-96.
7. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science. 14(9):1968;429-450.
8. Zangwill W.I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system. - a network approach Management Science. 15(9):1969;506-527.