Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs

Paul R. Kleindorfer and Zvi Lieber
Additional contact information
Paul R. Kleindorfer: University of Pennsylvania, Philadelphia, Pennsylvania
Zvi Lieber: Tel-Aviv University, Tel-Aviv, Israel

Operations Research, 1979, vol. 27, issue 5, 874-887

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.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.5.874 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:5:p:874-887

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().