Stochastic lot sizing problems

International Series in Operations Research and Management Science

Volumn 192, Issue , 2013, Pages 313-344

  Tempelmeier, Horst ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84908159387     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4614-6777-9_10     Document Type: Chapter

References (35)

1. Askin, R. (1981). A procedure for production lot sizing with probabilistic dynamic demand. AIIE Transactions, 13, 132-137.
2. Banerjee, A., & Paul, A. (2005). Average fill rate and horizon length. Operations Research Letters, 33, 525-530.
3. Bitran, G., & Yanasse, H. (1984). Deterministic approximations to stochastic production prob- lems. Operations Research, 32, 999-1018.
4. Bollapragada, S., & Morton, T. (1999). Simple heuristic for computing nonstationary (s, S) policies. Operations Research, 47, 576-584.
5. Bookbinder, J., & Tan, J.-Y. (1988). Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Science, 34, 1096-1108.
6. Bradley, S., Hax, A., & Magnanti, T. (1977). Applied mathematical programming. Reading: Addison-Wesley.
7. Buschkühl, L., Sahling, F., Helber, S., & Tempelmeier, H. (2010). Dynamic capacitated lot- sizing problems - a classification and review of solution approaches. OR Spectrum, 32(2), 231-261.
8. Chen, F., & Krass, D. (2001). Inventory models with minimal service level constraints. European Journal of Operational Research, 134, 120-140.
9. Chen, J., Lin, D., & Thomas, D. (2003). On the single item fill rate for a finite horizon. Operations Research Letters, 31, 119-123.
10. Guan, Y., Ahmed, S., Miller, A., & Nemhauser, G. (2006). On formulations of the stochastic uncapacitated lot-sizing problem. Operations Research Letters, 34, 241-250.
11. Helber, S., Sahling, F., & Schimmelpfeng, K. (2012). Dynamic capacitated lot sizing with random demand and dynamic safety stocks. OR Spectrum, 38, 75-105.
12. Herpers, S. (2009). Dynamische Losgrößenplanung bei stochastischer Nachfrage. Köln: K ölner Wissenschaftsverlag.
13. Iglehart, D. (1963). Dynamic programming and stationary analysis of inventory problems. In H. Scarf, D. Gilford, & M. Shelley (Eds.), Multistage inventory models and techniques. Stanford: Stanford University Press.
14. Lasserre, J., Bes, C., & Roubellat, F. (1985). The stochastic discrete dynamic lot size problem: An open-loop solution. Operations Research, 33, 684-689.
15. Maes, J., & Van Wassenhove, L. (1986). A simple heuristic for the multi item single level capacitated lotsizing problem. OR Letters, 4, 265-273.
16. Manne, A. (1958). Programming of economic lot sizes. Management Science, 4, 115-135.
17. Pochet, Y., & Wolsey, L. (2006). Production planning using mixed-integer programming. New York: Springer.
18. Rossi, R., Tarim, S., Hnich, B., & Prestwich, S. (2008). A global chance-constraint for stochastic inventory systems under service levels constraints. Constraints, 13, 490-517.
19. Sahling, F., Buschkühl, L., Helber, S., & Tempelmeier, H. (2009). Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers & Operations Research, 36, 2546-2553.
20. Scarf, H. (1959). The optimality of (S, s) policies in the dynamic inventory problem. In K. Arrow, S. Karlin, & P. Suppes (Eds.), Mathematical methods in the social sciences (pp 196-202). Stanford: Stanford University Press.
21. Sox, C. (1997). Dynamic lot sizing with random demand and non-stationary costs. Operations Research Letters, 20, 155-164.
22. Sox, C., Jackson, P., Bowman, A., & Muckstadt, J. (1999). A review of the stochastic lot scheduling problem. International Journal of Production Economics, 62, 181-200.
23. Tarim, S., & Kingsman, B. (2004). The stochastic dynamic production/inventory lot-sizing problem with service-level constraints. International Journal of Production Economics, 88, 105-119.
24. Tarim, S., & Kingsman, B. (2006). Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demands. European Journal of Operational Research, 174, 581-599.
25. Tempelmeier, H. (2007). On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints. European Journal of Operational Research, 181, 184-194.
26. Tempelmeier, H. (2011). A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Omega, 39, 627-633.
27. Tempelmeier, H. (2011). Inventory management in supply networks - problems, models, solutions (2nd ed.). Norderstedt: Books on Demand.
28. Tempelmeier, H., & Herpers, S. (2010). ABCβ - a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. International Journal of Production Research, 48, 5181-5193.
29. Tempelmeier, H., & Herpers, S. (2011). Dynamic uncapacitated lot sizing with random demand under a fillrate constraint. European Journal of Operational Research, 212(3), 497-507.
30. Tempelmeier, H., & Hilger, T. (2013). Linear programming models for the stochastic dynamic capacitated lot sizing problem. Technical report, University of Cologne, Department of Supply Chain Management and Production, Cologne, Germany.
31. Thomas, D. (2005). Measuring item fill-rate performance in a finite horizon. Manufacturing & Service Operations Management, 7, 74-80.
32. Tunc, H., Kilic, O., Tarim, S. A., & Eksioglu, B. (2011). The cost of using stationary inventory policies when demand is non-stationary. Omega, 39, 410-415.
33. Vargas, V. (2009). An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model. European Journal of Operational Research, 198, 447-451.
34. Wagner, H., & Whitin, T. (1958). Dynamic version of the economic lot size model. Management Science, 5, 89-96.
35. Winands, E., Adan, I., & van Houtum, G. (2011). The stochastic economic lot scheduling problem: A survey. European Journal of Operational Research, 210, 9.