APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q310334 |
Changed an Item |
||
| Property / author | |||
| Property / author: Denis Trystram / rank | |||
Normal rank | |||
Revision as of 00:09, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS |
scientific article |
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
