An O(N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
暂无分享,去创建一个
In this paper, we develop a dynamic programming algorithm for the scenario-tree-based stochastic uncapacitated lot-sizing problem with random lead times. Our algorithm runs in O(N^2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N^3) time.
[1] Peter Kall,et al. Stochastic Programming , 1995 .
[2] John R. Birge,et al. Introduction to Stochastic Programming , 1997 .
[3] Kai Huang,et al. On stochastic lot-sizing problems with random lead times , 2008, Oper. Res. Lett..
[4] R. Schultz,et al. Stochastic Integer Programming , 2003 .