Pages that link to "Item:Q852871"
From MaRDI portal
The following pages link to On multiprocessor task scheduling using efficient state space search approaches (Q852871):
Displaying 9 items.
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks (Q557669) (← links)
- Branch-and-bound task allocation with task clustering-based pruning (Q705569) (← links)
- Optimal multiprocessor task scheduling using dominance and equivalence relations (Q1318466) (← links)
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
- A two-pass scheduling algorithm for parallel programs (Q1334867) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- The optimal control approach to generalized multiprocessor scheduling (Q1907027) (← links)
- Task scheduling with precedence constraints to minimize the total completion time (Q4859027) (← links)