IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v34y1988i3p377-390.html
   My bibliography  Save this article

A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands

Author

Listed:
  • Robert C. Leachman

    (Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720)

  • André Gascon

    (Faculté des Sciences de l'Administration, Université Laval, Québec, Québec, Canada G1K 7P4)

Abstract

A heuristic scheduling policy is introduced for multi-item, single-machine production systems facing stochastic, time-varying demands. The policy, which we term the dynamic cycle lengths heuristic, integrates feedback control based on the monitoring of inventory levels with the maintenance of economic production cycles. The policy is applied time period by time period to make decisions concerning which items to produce in what quantities during the next time period. These quantities reflect production cycles revised each time period in response to differences between projected and actual inventory levels and in response to changes in demand rates. We extend the basic scheduling policy in order to integrate its use with tactical planning. We also discuss the results of simulation tests of the heuristic against other scheduling policies.

Suggested Citation

  • Robert C. Leachman & André Gascon, 1988. "A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands," Management Science, INFORMS, vol. 34(3), pages 377-390, March.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:3:p:377-390
    DOI: 10.1287/mnsc.34.3.377
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.3.377
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.3.377?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
    ---><---

    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:ormnsc:v:34:y:1988:i:3:p:377-390. 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.