Answers are grounded in this paper and cite their sources.
The column generation algorithm for the multi-item lot-size scheduling problem under resource constraints is examined and improved upon by augmenting simpler heuristic routines in place of the time-consuming Wagner-Whitin dynamic programming routine. The heuristic algorithms thus developed are tested by controlling problem size, setup time, demand variability, and capacity change costs in test problems. The empirical results indicate that the proposed heuristic algorithms reduce CPU time as well as the number of iterations with only a slight loss in optimality.
No takes yet. Share an insight, caveat, or question.
Harish C. Bahl (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: