An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461)
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: An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines |
scientific article; zbMATH DE number 2085788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines |
scientific article; zbMATH DE number 2085788 |
Statements
An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (English)
0 references
10 August 2004
0 references
scheduling
0 references
parallel machines
0 references
precedence constraints
0 references
preemptable tasks
0 references
