IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v41y1993i3p608-617.html
   My bibliography  Save this article

Decomposition for Scheduling Flexible Manufacturing Systems

Author

Listed:
  • Robert R. Inman

    (General Motors Research Laboratories, Warren, Michigan)

  • Philip C. Jones

    (Northwestern University, Evanston, Illinois)

Abstract

In some flexible manufacturing systems, tool magazine capacity naturally divides parts into families so that substantial setups occur only when switching production between families. For this situation (positive setup times and costs only between families), we show that the production planning problem decomposes into two simpler problems: an aggregate scheduling problem, and a disaggregation. First, we derive a disaggregation that determines the optimal intrafamily product schedules corresponding to a given family schedule in polynomial time. Second, we show how to aggregate so that the decomposition maintains optimality for family schedules satisfying the property that production does not begin until inventory is zero (the Zero-Switch rule).

Suggested Citation

  • Robert R. Inman & Philip C. Jones, 1993. "Decomposition for Scheduling Flexible Manufacturing Systems," Operations Research, INFORMS, vol. 41(3), pages 608-617, June.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:3:p:608-617
    DOI: 10.1287/opre.41.3.608
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.3.608
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.3.608?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. Bolat, Ahmet, 1997. "Sequencing jobs for an automated manufacturing module with buffer," European Journal of Operational Research, Elsevier, vol. 96(3), pages 622-635, February.
    2. Daniel Adelman & Christiane Barz, 2014. "A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 374-402, May.

    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:oropre:v:41:y:1993:i:3:p:608-617. 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.