The following pages link to (Q3678667):
Displaying 8 items.
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547) (← links)
- Tree scheduling with communication delays (Q1327224) (← links)
- Scheduling trees of malleable tasks for sparse linear algebra (Q1693050) (← links)
- Scheduling tree dags on parallel architectures (Q1911467) (← links)
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
- SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141) (← links)
- Scheduling task-tree with additive scales on parallel/distributed machines (Q6085760) (← links)
