Preemptive scheduling of equal-length jobs in polynomial time (Q626963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5853516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive scheduling of equal-length jobs in polynomial time |
scientific article; zbMATH DE number 5853516 |
Statements
Preemptive scheduling of equal-length jobs in polynomial time (English)
0 references
19 February 2011
0 references
machine scheduling
0 references
preemptive scheduling
0 references
equal-length jobs
0 references
parameterized algorithm
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
0.876089870929718
0 references
0.8611419200897217
0 references
0.8603537082672119
0 references
0.8571704030036926
0 references
