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

Mean Flow Time Minimization in Reentrant Job Shops with a Hub

Author

Listed:
  • Wieslaw Kubiak

    (Memorial University of Newfoundland, St. John's, Newfoundland, Canada)

  • Sheldon X. C. Lou

    (California State University San Marcos, San Marcos, California)

  • Yingmeng Wang

    (University of Toronto, Toronto, Ontario, Canada)

Abstract

This paper considers a reentrant job shop with one hub machine which a job enters K times. Between any two consecutive entries into the hub, the job is processed on other machines. The objective is to minimize the total flow time. Under two key assumptions, the bottleneck assumption and the hereditary order (HO) assumption on the processing times of the entries, it is proved that there is an optimal schedule with the shortest processing time (SPT) job order and a dynamic programming algorithm is derived to find such a schedule. An approximation algorithm based on the shortest path algorithm and the SPT job order is also proposed to solve the problem. The approximation algorithm finds an optimal clustered schedule. In clustered schedules, jobs are scheduled in disjoint clusters; they resemble batch processing and seem to be of practical importance. Worst-case bounds for clustered schedules are proved with the HO assumption relaxed. Two special cases with the restriction that there are only two entries to the hub machine are further analyzed to offer more insight into the structure of optimal solutions.

Suggested Citation

  • Wieslaw Kubiak & Sheldon X. C. Lou & Yingmeng Wang, 1996. "Mean Flow Time Minimization in Reentrant Job Shops with a Hub," Operations Research, INFORMS, vol. 44(5), pages 764-776, October.
    • Handle: RePEc:inm:oropre:v:44:y:1996:i:5:p:764-776
    DOI: 10.1287/opre.44.5.764
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.44.5.764
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.44.5.764?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. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.
    2. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    3. Wieslaw Kubiak & Yanling Feng & Guo Li & Suresh P. Sethi & Chelliah Sriskandarajah, 2020. "Efficient algorithms for flexible job shop scheduling with parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 272-288, June.
    4. JC-H Pan & J-S Chen, 2003. "Minimizing makespan in re-entrant permutation flow-shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 642-653, June.
    5. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    6. Ali Obeid & Stéphane Dauzère-Pérès & Claude Yugma, 2014. "Scheduling job families on non-identical parallel machines with time constraints," Annals of Operations Research, Springer, vol. 213(1), pages 221-234, February.

    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:44:y:1996:i:5:p:764-776. 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.