IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v281y2020i1p16-24.html
   My bibliography  Save this article

A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

Author

Listed:
  • Dong, Jianming
  • Jin, Ruyan
  • Luo, Taibo
  • Tong, Weitian

Abstract

We investigate the approximability of the m parallel two-stage flow-shop (mP2FS) problem, where a set of jobs is scheduled on the multiple identical two-stage flow-shops to minimize the makespan, i.e., the finishing time of the last job. Each job needs to be processed non-preemptively on one flow-shop without switching to the other flow-shops. This problem is a hybrid of the classic parallel machine scheduling and two-stage flow-shop scheduling problems. Its strong NP-hardness follows from the parallel machine scheduling problem when the number of machines is part of the input. Our main contribution is a polynomial-time approximation scheme (PTAS) for the mP2FS problem when the number of shops is part of the input, which improves the previous best approximation algorithm of a ratio (2+ϵ). Owing to the strong NP-hardness, our PTAS achieves the best possible approximation ratio.

Suggested Citation

  • Dong, Jianming & Jin, Ruyan & Luo, Taibo & Tong, Weitian, 2020. "A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops," European Journal of Operational Research, Elsevier, vol. 281(1), pages 16-24.
    • Handle: RePEc:eee:ejores:v:281:y:2020:i:1:p:16-24
    DOI: 10.1016/j.ejor.2019.08.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719306721
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.08.019?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:eee:ejores:v:281:y:2020:i:1:p:16-24. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.