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

Batching and Scheduling in FMS Hubs: Flow Time Considerations

Author

Listed:
  • Daniel E. Lane

    (University of Ottawa, Ottawa, Ontario, Canada)

  • Jeffrey B. Sidney

    (University of Ottawa, Ottawa, Ontario, Canada)

Abstract

Many flexible manufacturing systems (FMS) involve complex queueing networks in the processing of lots (jobs) in a production facility. In particular, the feedback of lots to a common, multipurpose workstation, or hub, processing different tasks for the same lot at various points in the production process, can create serious scheduling problems. This paper models the hub structure and presents some results for dual measures of flow time in the facility, namely, total flow time required for a fixed number of lots (or makespan), and average flow time for all lots (or average completion time). The flow time performance is a function of different batch sizes and priority scheduling rules for lots arriving at the hub. The results can be used to establish strategies for batching and scheduling lots according to adjustments in the importance of the cycle time versus the work-in-process (WIP) tradeoff. Extensions of the results to more general production facilities are also discussed.

Suggested Citation

  • Daniel E. Lane & Jeffrey B. Sidney, 1993. "Batching and Scheduling in FMS Hubs: Flow Time Considerations," Operations Research, INFORMS, vol. 41(6), pages 1091-1103, December.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:6:p:1091-1103
    DOI: 10.1287/opre.41.6.1091
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.6.1091
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.6.1091?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. Zhi-Long Chen & Nicholas G. Hall, 2007. "Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems," Operations Research, INFORMS, vol. 55(6), pages 1072-1089, December.
    2. 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.
    3. Zhi-Long Chen & Nicholas G. Hall, 2010. "The Coordination of Pricing and Scheduling Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 77-92, April.

    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:6:p:1091-1103. 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.