A Dual-Cost Heuristic For The Capacitated Lot Sizing Problem
暂无分享,去创建一个
[1] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[2] N. Adam,et al. The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .
[3] L Van Wassenhove,et al. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .
[4] N. Z. Shor. The rate of convergence of the generalized gradient descent method , 1968 .
[5] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .
[6] Peter J. Billington,et al. Multi-level lot-sizing with a bottleneck work center , 1983 .
[7] M. Lambrecht,et al. Heuristic Procedures for the Single Operation, Multi-Item Loading Problem , 1979 .
[8] P. R. Kleindorfer,et al. A Lower Bounding Structure for Lot-Size Scheduling Problems , 1975, Oper. Res..
[9] P. S. Eisenhut. A Dynamic Lot Sizing Algorithm with Capacity Constraints , 1975 .
[10] E. Silver,et al. A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .