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 this page instead for the normal view: HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS |
scientific article; zbMATH DE number 810147
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
