| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871745 | Discrete Applied Mathematics | 2018 | 15 Pages |
Abstract
The paper mostly deals with non-preemptive scheduling, but the preemptive scenario is also considered to some extent. Moreover, we introduce and study a third variant that we call interruptive scheduling. It is more restricted than preemptive, and less restricted than non-preemptive.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gyorgy Dosa, Zsolt Tuza,