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

Note: An Improvement to the Dynamic Cycle Lengths Heuristic for Scheduling the Multi-Item, Single-Machine

Author

Listed:
  • Robert C. Leachman

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

  • Zhong K. Xiong

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

  • André Gascon

    (Faculté des Sciences de l'Administration, Université Laval, Québec, Quebec, Canada G1K7P4)

  • Kwangtae Park

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

Abstract

A heuristic scheduling policy for multi-item, single-machine scheduling systems facing stochastic, time-varying demands was previously introduced by Leachman and Gascon. In this technical note we provide an improvement to the calculations of the policy. Simulation tests of the revised version of the policy indicate that the improvements maintain or enhance customer service while reducing total inventory and setup costs on the order of 1--7%.

Suggested Citation

  • Robert C. Leachman & Zhong K. Xiong & André Gascon & Kwangtae Park, 1991. "Note: An Improvement to the Dynamic Cycle Lengths Heuristic for Scheduling the Multi-Item, Single-Machine," Management Science, INFORMS, vol. 37(9), pages 1201-1205, September.
    • Handle: RePEc:inm:ormnsc:v:37:y:1991:i:9:p:1201-1205
    DOI: 10.1287/mnsc.37.9.1201
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.37.9.1201
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.37.9.1201?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. Smits, Sanne R. & Wagner, Michael & G. de Kok, Ton, 2004. "Determination of an order-up-to policy in the stochastic economic lot scheduling model," International Journal of Production Economics, Elsevier, vol. 90(3), pages 377-389, August.
    2. Leven, Erik & Segerstedt, Anders, 2007. "A scheduling policy for adjusting economic lot quantities to a feasible solution," European Journal of Operational Research, Elsevier, vol. 179(2), pages 414-423, June.
    3. Winands, E.M.M. & Adan, I.J.B.F. & van Houtum, G.J., 2011. "The stochastic economic lot scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 210(1), pages 1-9, April.
    4. Han Wu & Gerald Evans & Ki-Hwan Bae, 2016. "Production control in a complex production system using approximate dynamic programming," International Journal of Production Research, Taylor & Francis Journals, vol. 54(8), pages 2419-2432, April.
    5. Sox, Charles R. & Jackson, Peter L. & Bowman, Alan & Muckstadt, John A., 1999. "A review of the stochastic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 181-200, September.
    6. Sridhar Tayur, 2000. "Improving Operations and Quoting Accurate Lead Times in a Laminate Plant," Interfaces, INFORMS, vol. 30(5), pages 1-15, October.

    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:37:y:1991:i:9:p:1201-1205. 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.