The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming
暂无分享,去创建一个
Marc Salomon | Luk N. Van Wassenhove | Roelof Kuik | Stan P. M. van Hoesel | L. V. Wassenhove | R. Kuik | M. Salomon | S. Hoesel
[1] B. Fleischmann. The discrete lot-sizing and scheduling problem , 1990 .
[2] Linus Schrage,et al. The Multiproduct Lot Scheduling Problem , 1982 .
[3] L. V. Wassenhove,et al. Some extensions of the discrete lotsizing and scheduling problem , 1991 .
[4] Luk N. Van Wassenhove,et al. Planning production in a bottleneck department , 1983 .
[5] Leon S. Lasdon,et al. An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..
[6] Dirk Cattrysse,et al. A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .
[7] Thomas L. Magnanti,et al. A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..
[8] Albert P. M. Wagelmans,et al. Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..