Loading…

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

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 employme...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 1979-09, Vol.27 (5), p.874-887
Main Authors: Kleindorfer, Paul R, Lieber, Zvi
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.27.5.874