On stochastic lot-sizing problems with random lead times

Aggarwal, 1993, Improved algorithms for economic lot size problems, Operations Research, 41, 549, 10.1287/opre.41.3.549 Ahmed, 2003, A multi-stage stochastic integer programming approach for capacity expansion under uncertainty, Journal of Global Optimization, 26, 3, 10.1023/A:1023062915106 Alp, 2003, Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs, Operations Research, 51, 160, 10.1287/opre.51.1.160.12799 Arrow, 1958 Ehrhardt, 1984, (s,S) policies for a dynamic inventory model with stochastic lead times, Operations Research, 32, 121, 10.1287/opre.32.1.121 Federgruen, 1991, A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlogn) or O(n) time, Management Science, 37, 909, 10.1287/mnsc.37.8.909 Guan, 2006, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, Mathematical Programming, 105, 55, 10.1007/s10107-005-0572-9 Y. Guan, A.J. Miller, Polynomial time algorithms for uncapacitated stochastic lot-sizing problems, Research Report, 2006 Kaplan, 1970, A dynamic inventory model with stochastic lead times, Management Science, 16, 491, 10.1287/mnsc.16.7.491 Liberatore, 1984, Planning horizons for a stochastic lead-time inventory model, Operations Research, 25, 977, 10.1287/opre.25.6.977 Lulli, 2004, Branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems, Management Science, 50, 786, 10.1287/mnsc.1030.0164 Nevison, 1984, The dynamic lot-size model with stochastic lead times, Management Science, 30, 100, 10.1287/mnsc.30.1.100 Wagelmans, 1992, Economic lot sizing: An O(nlogn) algorithm that runs in linear time in the Wagner–Whitin case, Operations Research, 40, S145, 10.1287/opre.40.1.S145 Wagner, 1958, Dynamic version of the economic lot size model, Management Science, 5, 89, 10.1287/mnsc.5.1.89