Pages that link to "Item:Q1265894"
From MaRDI portal
The following pages link to An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894):
Displaying 10 items.
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- The resource-constrained modulo scheduling problem: an experimental study (Q2377171) (← links)
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Scheduling with precedence constraints: Worst-case analysis of priority algorithms (Q4709806) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
