A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging

  • Yongpei Guan
  • Andrew Miller
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5035)


Since Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, many other researchers have investigated the structure of other fundamental models on lot-sizing that are embedded in practical production planning problems. In this paper we consider basic versions of such models in which demand (and other problem parameters) are stochastic rather than deterministic. It is named stochastic uncapacitated lot-sizing problem with backlogging. We define a production path property of optimal solutions for this model and use this property to develop backward dynamic programming recursions. This approach allows us to show that the value function is piecewise linear and continuous, which we can further use to define a polynomial time algorithm for the problem in a general stochastic scenario tree setting.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aggarwal, A., Park, J.K.: Improved algorithms for economic lot size problems. Operations Research 41, 549–571 (1993)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Ahmed, S., King, A.J., Parija, G.: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Journal of Global Optimization 26, 3–24 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ahmed, S., Sahinidis, N.V.: An approximation scheme for stochastic integer programs arising in capacity expansion. Operations Research 51, 461–471 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Belvaux, G., Wolsey, L.A.: bc − prod: a specialized branch–and–cut system for lot-sizing problems. Management Science 46, 724–738 (2000)CrossRefGoogle Scholar
  5. 5.
    Belvaux, G., Wolsey, L.A.: Modelling practical lot–sizing problems as mixed integer programs. Management Science 47, 993–1007 (2001)CrossRefGoogle Scholar
  6. 6.
    Beraldi, P., Ruszczyński, A.: A branch and bound method for stochastic integer problems under probabilistic constraints. Optimization Methods and Software 17, 359–382 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Carøe, C.C.: Decomposition in stochastic integer programming. PhD thesis, University of Copenhagen (1998)Google Scholar
  8. 8.
    Clark, A.J., Scarf, H.: Optimal policies for a multi-echelon inventory problem. Management Science 6, 475–490 (1960)Google Scholar
  9. 9.
    Federgruen, A., Tzur, M.: A simple forward algorithm to solve general dynamic lot sizing models with n periods in \(\mathcal{O}\)(n logn) or \(\mathcal{O}\)(n) time. Management Science 37, 909–925 (1991)zbMATHGoogle Scholar
  10. 10.
    Federgruen, A., Tzur, M.: The dynamic lot-sizing model with backlogging-a simple \(\mathcal{O}\)(n logn) algorithm and minimal forecast horizon procedure. Naval Research Logistics 40, 459–478 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Management Science 18, 12–20 (1971)MathSciNetGoogle Scholar
  12. 12.
    Guan, Y., Ahmed, S., Nemhauser, G.L., Miller, A.J.: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Mathematical Programming 105, 55–84 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Guan, Y., Miller, A.J.: Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Operations Research (to appear, 2007)Google Scholar
  14. 14.
    Lee, C.Y., Cetinkaya, S., Wagelmans, A.: A dynamic lot-sizing model with demand time windows. Management Science 47, 1384–1395 (2001)Google Scholar
  15. 15.
    Lulli, G., Sen, S.: A branch-and-price algorithm for multi-stage stochastic integer programming with application to stochastic batch-sizing problems. Management Science 50, 786–796 (2004)CrossRefGoogle Scholar
  16. 16.
    Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)zbMATHGoogle Scholar
  17. 17.
    Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)zbMATHGoogle Scholar
  18. 18.
    Ruszczyński, A., Shapiro, A. (eds.): Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10. Elsevier Science B.V., Amsterdam (2003)Google Scholar
  19. 19.
    Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming 106, 203–223 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Stadtler, H.: Multi-level lot-sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research 51, 487–502 (2003)CrossRefzbMATHGoogle Scholar
  21. 21.
    Di Summa, M., Wolsey, L.A.: Lot-sizing on a tree. Technical report, CORE, UCL, Louvain-la-Neuve, Belgium (2006)Google Scholar
  22. 22.
    Tempelmeier, H., Derstroff, M.: A Lagrangean–based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42, 738–757 (1996)zbMATHGoogle Scholar
  23. 23.
    van Hoesel, C.P.M., Wagelmans, A.: An \(\mathcal{O}\)(T 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science 42, 142–150 (1996)zbMATHGoogle Scholar
  24. 24.
    Wagelmans, A., van Hoesel, A., Kolen, A.: Economic lot sizing: An \(\mathcal{O}\)(n logn) algorithm that runs in linear time in the Wagner–Whitin case. Operations Research 40, 145–156 (1992)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Wolsey, L.A.: Integer Programming. Wiley, New York (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yongpei Guan
    • 1
  • Andrew Miller
    • 2
  1. 1.School of Industrial EngineeringUniversity of OklahomaUSA
  2. 2.Department of Industrial and Systems EngineeringUniversity of WisconsinUSA

Personalised recommendations