Pages that link to "Item:Q1290161"

The following pages link to On the minimum number of processors for scheduling problems with communication delays (Q1290161):

Displaying 7 items.

• A note on Graham's bound (Q916353) (← links)
• Minimizing the number of machines for scheduling jobs with equal processing times (Q1042179) (← links)
• Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
• Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166) (← links)
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors (Q1900934) (← links)
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)