References & Citations
Mathematics > Optimization and Control
Title: Approximation algorithms for coupled task scheduling minimizing the sum of completion times
(Submitted on 1 Jul 2022 (v1), last revised 29 Sep 2022 (this version, v2))
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 NP-hard, while also proving NP-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.
Submission history
From: Péter Györgyi [view email][v1] Fri, 1 Jul 2022 12:59:05 GMT (20kb)
[v2] Thu, 29 Sep 2022 12:58:50 GMT (26kb)
Link back to: arXiv, form interface, contact.