An approximation algorithm for scheduling malleable tasks under general precedence constraints (Q2944524): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1159892.1159899 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967030015 / rank | |||
Normal rank | |||
Latest revision as of 22:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for scheduling malleable tasks under general precedence constraints |
scientific article |
Statements
An approximation algorithm for scheduling malleable tasks under general precedence constraints (English)
0 references
2 September 2015
0 references
approximation algorithms
0 references
malleable tasks
0 references
precedence constraints
0 references
scheduling
0 references
