| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142973 | Operations Research Letters | 2009 | 4 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt,