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

Optimal and Heuristic Procedures for Component Lot-Splitting in Multi-Stage Manufacturing Systems

Author

Listed:
  • Jaya P. Moily

    (School of Management, Syracuse University, Syracuse, New York, 13210)

Abstract

Component lot-splitting considerations, in which the lot-size of a component item may cover only a fraction of its parent item's lot-size, have been ignored in the literature when determining lot-sizes of items in multi-stage manufacturing systems. In this paper, a multi-stage lot-sizing problem is formulated under a specified component lot-splitting policy for the case of noninstantaneous production of items and constant demand for the end item. Optimal and heuristic solution procedures for the formulated problem are provided, including experimental results of comparison between these procedures. It is shown that considerable cost savings can result if the component lot-splitting approach is employed under favorable conditions in multi-stage manufacturing environments. In addition, reduced inventory levels are achieved which translate into lower working capital requirements and a less cluttered shop floor. The heuristic procedure is recommended as an acceptable alternative to the optimal procedure if the number of items in the multi-stage system is large or if inventory carrying and setup/order costs cannot be accurately estimated. Further, component lot-splitting considerations may be ignored if production rates of facilities in the system are in balance. Finally, a methodology for application of the component lot-splitting policy where the end item demand is time-varying is discussed.

Suggested Citation

  • Jaya P. Moily, 1986. "Optimal and Heuristic Procedures for Component Lot-Splitting in Multi-Stage Manufacturing Systems," Management Science, INFORMS, vol. 32(1), pages 113-125, January.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:1:p:113-125
    DOI: 10.1287/mnsc.32.1.113
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.1.113
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.1.113?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. 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.
    2. Ouenniche, Jamal & Boctor, Fayez F., 2001. "The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops," European Journal of Operational Research, Elsevier, vol. 129(3), pages 539-554, March.
    3. Pundoor, Guruprasad & Chen, Zhi-Long, 2009. "Joint cyclic production and delivery scheduling in a two-stage supply chain," International Journal of Production Economics, Elsevier, vol. 119(1), pages 55-74, May.
    4. Hong, Jae-Dong, 1997. "Optimal production cycles, procurement schedules, and joint investment in an imperfect production system," European Journal of Operational Research, Elsevier, vol. 100(3), pages 413-428, August.
    5. Huang, Rong-Hwa, 2010. "Multi-objective job-shop scheduling with lot-splitting production," International Journal of Production Economics, Elsevier, vol. 124(1), pages 206-213, March.

    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:32:y:1986:i:1:p:113-125. 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.