ALGORITHMS AND PLANNING HORIZON RESULTS FOR PRODUCTION PLANNING PROBLEMS WITH SEPARABLE COSTS.

Paul R. Kleindorfer*, Zvi Lieber

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)874-887
Number of pages14
JournalOperations Research
Volume27
Issue number5
DOIs
StatePublished - 1979

Fingerprint

Dive into the research topics of 'ALGORITHMS AND PLANNING HORIZON RESULTS FOR PRODUCTION PLANNING PROBLEMS WITH SEPARABLE COSTS.'. Together they form a unique fingerprint.

Cite this