Approximation algorithms for coupled task scheduling minimizing the sum of completion times

David Fischer () and Péter Györgyi ()
Additional contact information
David Fischer: Institute for Algorithms and Complexity
Péter Györgyi: Eötvös Loránd Research Network

Annals of Operations Research, 2023, vol. 328, issue 2, No 9, 1387-1408

Abstract: Abstract In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several variants of this problem that are known to be $$\mathcal{N}\mathcal{P}$$ N P -hard, while also proving $$\mathcal{N}\mathcal{P}$$ N P -hardness for two variants whose complexity was unknown before. Using these results, together with constant-factor approximations for the makespan objective from the literature, we also introduce the first results on bi-objective approximation in the coupled task setting.

Keywords: Single machine scheduling; Coupled task problem; Approximation algorithms; Total completion times (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/s10479-023-05322-5 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:annopr:v:328:y:2023:i:2:d:10.1007_s10479-023-05322-5

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

DOI: 10.1007/s10479-023-05322-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

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