Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines (Q3329205)
From MaRDI portal
!
WARNING
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 3860871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines |
scientific article; zbMATH DE number 3860871 |
Statements
Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines (English)
0 references
1984
0 references
heuristic procedure
0 references
N unit jobs
0 references
m identical processors in parallel
0 references
total weighted completion times
0 references
bounds on the worst-case performance
0 references
0 references
0.9215793
0 references
0.91547567
0 references
0.91467243
0 references
0.9138335
0 references
0.9126283
0 references
0.9117879
0 references
0.9100324
0 references
