The following pages link to (Q4473911):
Displaying 8 items.
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440) (← links)
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
- Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems (Q1898204) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- (Q4220472) (← links)
- (Q4536380) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)
