Universal Planning Horizons for Generalized Convex Production Scheduling

Thomas E. Morton
Additional contact information
Thomas E. Morton: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1978, vol. 26, issue 6, 1046-1058

Abstract: We study an infinite-horizon analog of the well-known finite-horizon convex production scheduling model with positive or negative demands, production, and inventory, and with constraints on inventory and production. We develop a forward algorithm for this problem allowing successively tighter bounds on the optimal first-period production to be given as successive demand forecasts are added to the problem. We show under very general conditions that the algorithm will always lead to an exact or asymptotic planning horizon. Planning horizon results due to others form special cases. Applications of the generalized production scheduling model include capacity expansion problems.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.6.1046 (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:26:y:1978:i:6:p:1046-1058

Access Statistics for this article

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