IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i7p1717-1729.html
   My bibliography  Save this article

Production-Planning Algorithms for the Inventory-Overtime Tradeoff

Author

Listed:
  • Howard Kunreuther

    (University of Chicago, Chicago, Illinois)

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.

Suggested Citation

  • Howard Kunreuther, 1971. "Production-Planning Algorithms for the Inventory-Overtime Tradeoff," Operations Research, INFORMS, vol. 19(7), pages 1717-1729, December.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1717-1729
    DOI: 10.1287/opre.19.7.1717
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.7.1717
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.7.1717?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nasuh Buyukkaramikli & J. Bertrand & Henny Ooijen, 2013. "Flexible hiring in a make to order system with parallel processing units," Annals of Operations Research, Springer, vol. 209(1), pages 159-178, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1717-1729. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.