Production-Planning Algorithms for the Inventory-Overtime Tradeoff

Howard Kunreuther
Additional contact information
Howard Kunreuther: University of Chicago, Chicago, Illinois

Operations Research, 1971, vol. 19, issue 7, 1717-1729

Abstract: This paper develops planning-horizon theorems and algorithms for determining optimal production in period 1 when there are linear costs associated with overtime and inventory, and demand is deterministic. If overtime in each period is unrestricted and no shortages are permitted, then it is easily shown that the firm will have to know future demand for at most the next k * periods, where k * is determined by the ratio of the wage differential between overtime and regular time to the per unit holding cost per period. Using the k * concept, the paper determines planning horizons when both storage and backlogging of demand are allowed. If overtime constraints are imposed, a planning algorithm is proposed that requires less information on future demand than a linear programming model. Economic implications of this approach for decision-making and information processing in firms are discussed.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1717 (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:19:y:1971:i:7:p:1717-1729

Access Statistics for this article

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