Preemptive scheduling of interval orders is polynomial (Q913500)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Preemptive scheduling of interval orders is polynomial |
scientific article; zbMATH DE number 4147496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling of interval orders is polynomial |
scientific article; zbMATH DE number 4147496 |
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
0.88729954
0 references
0.8818756
0 references
0.8793691
0 references
0.8742387
0 references
0.8723399
0 references
0.8661919
0 references
0.86482537
0 references
0.8629324
0 references
