Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 874-887 |
Number of pages | 14 |
Journal | Operations Research |
Volume | 27 |
Issue number | 5 |
DOIs | |
State | Published - 1979 |