IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i2d10.1007_s10878-024-01107-z.html
   My bibliography  Save this article

On scheduling multiple parallel two-stage flowshops with Johnson’s Rule

Author

Listed:
  • Guangwei Wu

    (Central South University of Forestry and Technology
    Central South University)

  • Fu Zuo

    (Central South University of Forestry and Technology)

  • Feng Shi

    (Central South University
    Xiangjiang Laboratory)

  • Jianxin Wang

    (Central South University)

Abstract

It is well-known that the classical Johnson’s Rule leads to optimal schedules on a two-stage flowshop. However, it is still unclear how Johnson’s Rule would help in approximation algorithms for scheduling an arbitrary number of parallel two-stage flowshops with the objective of minimizing the makespan. Thus within the paper, we study the problem and propose a new efficient algorithm that incorporates Johnson’s Rule applied on each individual flowshop with a carefully designed job assignment process to flowshops. The algorithm is successfully shown to have a runtime $$O(n \log n)$$ O ( n log n ) and an approximation ratio 7/3, where n is the number of jobs. Compared with the recent PTAS result for the problem (Dong et al. in Eur J Oper Res 218(1):16–24, 2020), our algorithm has a larger approximation ratio, but it is more efficient in practice from the perspective of runtime.

Suggested Citation

  • Guangwei Wu & Fu Zuo & Feng Shi & Jianxin Wang, 2024. "On scheduling multiple parallel two-stage flowshops with Johnson’s Rule," Journal of Combinatorial Optimization, Springer, vol. 47(2), pages 1-20, March.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-024-01107-z
    DOI: 10.1007/s10878-024-01107-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01107-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01107-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-024-01107-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.