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

Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production

Author

Listed:
  • Mohammad K. El-Najdawi

    (College of Commerce and Finance, Villanova University, Villanova, Pennsylvania 19085)

  • Paul R. Kleindorfer

    (The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104)

Abstract

In this paper we study the Common Cycle Scheduling Problem (CCSP). This classic production problem is concerned with determining optimal production lot sizes for a given set of products using a common facility. CCSP is based on scheduling all products using a common (base) cycle time, so that the lot size for each product is the forecasted demand for that product over the base cycle time. This research provides an optimizing framework for CCSP for a multi-stage, multi-product, flow-shop environment under deterministic and stationary conditions, assuming a fixed sequence is maintained across all processing stages. The framework presented considers the costs of work-in-process inventory and determines a jointly optimal common cycle time and production schedule (start and finish times for each product's production lot-size) for the multi-stage facility in question. The paper also reports some results on the impact of alternative sequencing rules for the CCSP context.

Suggested Citation

  • Mohammad K. El-Najdawi & Paul R. Kleindorfer, 1993. "Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production," Management Science, INFORMS, vol. 39(7), pages 872-885, July.
    • Handle: RePEc:inm:ormnsc:v:39:y:1993:i:7:p:872-885
    DOI: 10.1287/mnsc.39.7.872
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.39.7.872
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.39.7.872?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. M Khouja, 2003. "Synchronization in supply chains: implications for design and management," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 984-994, September.
    2. Hoque, M.A., 2011. "An optimal solution technique to the single-vendor multi-buyer integrated inventory supply chain by incorporating some realistic factors," European Journal of Operational Research, Elsevier, vol. 215(1), pages 80-88, November.
    3. Fayez F. Boctor & Marie-Claude Bolduc, 2018. "The inventory replenishment planning and staggering problem: a bi-objective approach," 4OR, Springer, vol. 16(2), pages 199-224, June.
    4. Hoque, M.A. & Kingsman, B.G., 2006. "Synchronization in common cycle lot size scheduling for a multi-product serial supply chain," International Journal of Production Economics, Elsevier, vol. 103(1), pages 316-331, September.
    5. 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.
    6. Torabi, S.A. & Karimi, B. & Fatemi Ghomi, S.M.T., 2005. "The common cycle economic lot scheduling in flexible job shops: The finite horizon case," International Journal of Production Economics, Elsevier, vol. 97(1), pages 52-65, July.
    7. Van den broecke, Frank & Van Landeghem, Hendrik & Aghezzaf, El-Houssaine, 2008. "Implementing a near-optimal solution for the multi-stage, multi-product capacitated lot-sizing problem by rolling out a cyclical production plan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 121-137, 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:39:y:1993:i:7:p:872-885. 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.