Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A coupled task scheduling approximation algorithm for minimizing the sum of completion times. |
| Συγγραφείς: |
Békési, József1 (AUTHOR) bekesi@inf.u-szeged.hu, Dósa, György2 (AUTHOR) dosa.gyorgy@mik.uni-pannon.hu, Galambos, Gábor3 (AUTHOR) GalambosGabor@szte.hu |
| Πηγή: |
Annals of Operations Research. Jul2026, Vol. 362 Issue 1-3, p1-26. 26p. |
| Θεματικοί όροι: |
*Scheduling, *Algorithms, Approximation algorithms, Asymptotic analysis, Greedy algorithms |
| Περίληψη: |
In the considered coupled task problem (CTP) we have to schedule n jobs on a single machine, each consisting of two tasks with exact time delay between them, while the objective is to minimize the total completion time of the jobs. We analyze a greedy type algorithm – called SDF (Shortest Delay First) – from worst case point of view, and we give bounds for the asymptotic behavior of SDF for the special case where each task has equal length processing time p. For this case, the best-known upper bound on the asymptotic performance ratio of algorithm SDF is 5 3 ≈ 1.666 .... We improve this bound to a general upper bound 21 p - 3 (43 p 2 - 28 p + 4) - 6 6 p that holds for all p ≥ 2. Using constructions to compute lower bounds, we give narrow intervals for the asymptotic behavior of algorithm SDF as a function of the parameter p. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |