HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS (Q4853326)
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 810147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS |
scientific article; zbMATH DE number 810147 |
Statements
HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS (English)
0 references
29 October 1995
0 references
nonpreemptively scheduling
0 references
multiprocessor
0 references
0.8409668803215027
0 references
0.8349743485450745
0 references
0.8247401714324951
0 references
0.8110410571098328
0 references
