Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Park, J.K.: Improved algorithms for economic lot size problems. Operations Research 41, 549–571 (1993)
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)
Ahmed, S., Sahinidis, N.V.: An approximation scheme for stochastic integer programs arising in capacity expansion. Operations Research 51, 461–471 (2003)
Belvaux, G., Wolsey, L.A.: bc − prod: a specialized branch–and–cut system for lot-sizing problems. Management Science 46, 724–738 (2000)
Belvaux, G., Wolsey, L.A.: Modelling practical lot–sizing problems as mixed integer programs. Management Science 47, 993–1007 (2001)
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)
Carøe, C.C.: Decomposition in stochastic integer programming. PhD thesis, University of Copenhagen (1998)
Clark, A.J., Scarf, H.: Optimal policies for a multi-echelon inventory problem. Management Science 6, 475–490 (1960)
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)
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)
Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Management Science 18, 12–20 (1971)
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)
Guan, Y., Miller, A.J.: Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Operations Research (to appear, 2007)
Lee, C.Y., Cetinkaya, S., Wagelmans, A.: A dynamic lot-sizing model with demand time windows. Management Science 47, 1384–1395 (2001)
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)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)
Ruszczyński, A., Shapiro, A. (eds.): Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10. Elsevier Science B.V., Amsterdam (2003)
Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming 106, 203–223 (2006)
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)
Di Summa, M., Wolsey, L.A.: Lot-sizing on a tree. Technical report, CORE, UCL, Louvain-la-Neuve, Belgium (2006)
Tempelmeier, H., Derstroff, M.: A Lagrangean–based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42, 738–757 (1996)
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)
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)
Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guan, Y., Miller, A. (2008). A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)