An improved approximation algorithm for a scheduling problem with transporter coordination

Yinling Wang (), Xin Han (), Yong Zhang () and Jacek Blazewicz ()
Additional contact information
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

Journal of Scheduling, 2023, vol. 26, issue 6, No 5, 559-570

Abstract: 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.

Keywords: Approximation algorithm; Scheduling; Transporter (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-022-00762-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:26:y:2023:i:6:d:10.1007_s10951-022-00762-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-022-00762-6

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().