IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v26y2023i6d10.1007_s10951-022-00762-6.html
   My bibliography  Save this article

An improved approximation algorithm for a scheduling problem with transporter coordination

Author

Listed:
  • Yinling Wang

    (Zhengzhou University)

  • Xin Han

    (Dalian University of Technology)

  • Yong Zhang

    (Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences)

  • Jacek Blazewicz

    (Poznan University of Technology
    Institute of Bioorganic Chemistry, Polish Academy of Sciences
    European Center for Bioinformatics and Genomics)

Abstract

We study the following scheduling problem with transportation. Given a set of n jobs that need to be processed on a single machine, we need to deliver the finished jobs to one of the two destinations using a single transporter. The goal is to minimize the time that all the jobs are delivered to their destination, such that the transporter returns. We propose a $$11/6+\varepsilon $$ 11 / 6 + ε -approximation algorithm which improves upon the best-known approximation ratio of 2.

Suggested Citation

  • Yinling Wang & Xin Han & Yong Zhang & Jacek Blazewicz, 2023. "An improved approximation algorithm for a scheduling problem with transporter coordination," Journal of Scheduling, Springer, vol. 26(6), pages 559-570, December.
    • Handle: RePEc:spr:jsched:v:26:y:2023:i:6:d:10.1007_s10951-022-00762-6
    DOI: 10.1007/s10951-022-00762-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00762-6
    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-022-00762-6?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:26:y:2023:i:6:d:10.1007_s10951-022-00762-6. 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.