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

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

Author

Listed:
  • José F. Gonçalves

    (GEIN, Department of Mechanical Engineering, University of Porto, Rua dos Bragas, 4099 Porto Codex, Portugal)

  • Robert C. Leachman

    (Engineering Systems Research Center, University of California, Berkeley, California 94720)

  • André Gascon

    (Groupe de recherche en gestion de la logistique, Faculté des sciences de l'administration, Université Laval, Ste - Foy, Quebec, Canada G1K 7P4)

  • Zhong K. Xiong

    (Management Engineering Department, Chongqing Communication Institute, Stchuan, People's Republic of China)

Abstract

An effective scheduling policy known as the Dynamic Cycle Lengths Heuristic was introduced by Leachman and Gascon in 1988 for the multi-item, single-machine production system facing stochastic, time-varying demands. In this article we develop a heuristic scheduling policy for the multi-machine extension of the same problem. We integrate the concepts of the Dynamic Cycle Lengths Heuristic with a nonlinear integer optimization model to obtain an overall scheduling policy that allocates items to machines and schedules production quantities during the next time period. We report promising performance in limited simulation tests of the policy.

Suggested Citation

  • José F. Gonçalves & Robert C. Leachman & André Gascon & Zhong K. Xiong, 1994. "A Heuristic Scheduling Policy for Multi-Item, Multi-Machine Production Systems with Time-Varying, Stochastic Demands," Management Science, INFORMS, vol. 40(11), pages 1455-1468, November.
    • Handle: RePEc:inm:ormnsc:v:40:y:1994:i:11:p:1455-1468
    DOI: 10.1287/mnsc.40.11.1455
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.40.11.1455
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.40.11.1455?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. Goncalves, JoseF. & Leachman, Robert C., 1998. "A hybrid heuristic and linear programming approach to multi-product machine scheduling," European Journal of Operational Research, Elsevier, vol. 110(3), pages 548-563, November.
    2. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:40:y:1994:i:11:p:1455-1468. 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.