Back to Search
Start Over
Approximation algorithms for coupled task scheduling minimizing the sum of completion times.
- Source :
-
Annals of Operations Research . Sep2023, Vol. 328 Issue 2, p1387-1408. 22p. - Publication Year :
- 2023
-
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 N P -hard, while also proving 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *APPROXIMATION algorithms
*SCHEDULING
*WORKING hours
*PRODUCTION scheduling
Subjects
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 328
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 169946489
- Full Text :
- https://doi.org/10.1007/s10479-023-05322-5