Preemptive scheduling of interval orders is polynomial (Q913500)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling of interval orders is polynomial |
scientific article |
Statements
Preemptive scheduling of interval orders is polynomial (English)
0 references
1989
0 references
The authors show that a polynomial time algorithm can be found for the scheduling of jobs with a preemptive scheduling rule when the precedence constraints form an interval order.
0 references
scheduling
0 references
polynomial time algorithm
0 references
