Answers are grounded in this paper and cite their sources.
A generalization of the Modigliani-Hohn production scheduling problem including new computational algorithms and planning horizon results is first investigated. These results are then coupled with decomposition methods in providing a computational algorithm for the production scheduling and employment smoothing problems with separable convex costs.
No takes yet. Share an insight, caveat, or question.
Kleindorfer et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: