Improved analysis of an algorithm for the coupled task problem with UET jobs |
| |
| Authors: | József Békési Marcus Oswald |
| |
| Institution: | a Institute of Informatics, University of Heidelberg, Germany
b Department of Informatics, Faculty of Juhász Gyula Teacher’s Training College, University of Szeged, Hungary |
| |
| Abstract: | The coupled task problem is to schedule n jobs, each one consisting of two subtasks with exact delay times between them, on a single machine. We derive a new lower bound for the problem variant with unit execution times and correct a previously published analysis. |
| |
| Keywords: | Scheduling Coupled tasks Approximation algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
