APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973)
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: APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS |
scientific article; zbMATH DE number 2177761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS |
scientific article; zbMATH DE number 2177761 |
Statements
APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (English)
0 references
22 June 2005
0 references
parallel computing
0 references
scheduling
0 references
malleable tasks
0 references
precedence constraints
0 references
series parallel order
0 references
bounded width
0 references
approximation algorithm
0 references
project management
0 references
discrete time-cost tradeoff problem
0 references
0.9978682398796082
0 references
0.9366285800933838
0 references
0.9366284608840942
0 references
0.9295609593391418
0 references
