Pages that link to "Item:Q3002561"
From MaRDI portal
The following pages link to Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561):
Displaying 3 items.
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)