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 the normal view instead:
scientific article; zbMATH DE number 2085788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8275889754295349
0 references
0.8232104778289795
0 references
0.8184893727302551
0 references
