APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The discrete time-cost tradeoff problem revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Scheduling Parallel Task Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Scheduling under Precedence Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem / rank | |||
Normal rank | |||
Revision as of 12:45, 10 June 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
