The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2588837743 / rank | |||
Normal rank | |||
Revision as of 03:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays |
scientific article |
Statements
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (English)
0 references
1 September 2017
0 references
list scheduling algorithms
0 references
polynomial subproblems
0 references
approximation algorithms
0 references
