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

Paul R. Kleindorfer; Zvi Lieber

doi:10.1287/opre.27.5.874

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

Paul R. Kleindorfer^*, Zvi Lieber

^*Corresponding author for this work

Coller School of Management

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	874-887
Number of pages	14
Journal	Operations Research
Volume	27
Issue number	5
DOIs	https://doi.org/10.1287/opre.27.5.874
State	Published - 1979

Access to Document

10.1287/opre.27.5.874

Cite this

@article{318f71731d214c4e8f582352a47b7203,

title = "ALGORITHMS AND PLANNING HORIZON RESULTS FOR PRODUCTION PLANNING PROBLEMS WITH SEPARABLE COSTS.",

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.",

author = "Kleindorfer, {Paul R.} and Zvi Lieber",

year = "1979",

doi = "10.1287/opre.27.5.874",

language = "אנגלית",

volume = "27",

pages = "874--887",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "5",

}

TY - JOUR

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

AU - Kleindorfer, Paul R.

AU - Lieber, Zvi

PY - 1979

Y1 - 1979

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

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

UR - http://www.scopus.com/inward/record.url?scp=0018519758&partnerID=8YFLogxK

U2 - 10.1287/opre.27.5.874

DO - 10.1287/opre.27.5.874

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0018519758

SN - 0030-364X

VL - 27

SP - 874

EP - 887

JO - Operations Research

JF - Operations Research

IS - 5

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this