IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i1d10.1007_s10951-023-00781-x.html
   My bibliography  Save this article

Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits

Author

Listed:
  • Xiaojuan Jiang

    (Shanghai Jiao Tong University)

  • Kangbok Lee

    (Pohang University of Science and Technology)

  • Michael L. Pinedo

    (New York University)

Abstract

We consider bicriteria flowshop scheduling problems with two machines to simultaneously minimize the makespan and the total completion time without any prioritization between the two objectives. An approximation relative to the optimal value of the problem with regard to each objective is adopted, even though a schedule with both objectives reaching their minimum at the same time may not exist. We consider several problems with ordered aspects on processing times such as job ordered and machine ordered. For each problem, we propose a fast $$(\rho _1,\rho _2)$$ ( ρ 1 , ρ 2 ) -approximation algorithm, where $$\rho _1$$ ρ 1 and $$\rho _2$$ ρ 2 indicate the approximation ratios with regard to the makespan and the total completion time, respectively, and we explore the problem’s inapproximability region that cannot be reached by any algorithm.

Suggested Citation

  • Xiaojuan Jiang & Kangbok Lee & Michael L. Pinedo, 2024. "Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits," Journal of Scheduling, Springer, vol. 27(1), pages 61-86, February.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:1:d:10.1007_s10951-023-00781-x
    DOI: 10.1007/s10951-023-00781-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-023-00781-x
    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/s10951-023-00781-x?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:jsched:v:27:y:2024:i:1:d:10.1007_s10951-023-00781-x. 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.