Pages that link to "Item:Q3826356"
From MaRDI portal
The following pages link to Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356):
Displaying 9 items.
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length (Q1062615) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- Using an eraser or a pencil for two-processor scheduling (Q1272955) (← links)
- Minimizing the overhead for some tree-scheduling problems (Q1278303) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- Scheduling of resource tasks (Q1809809) (← links)
- Hu's precedence tree scheduling algorithm: A simple proof (Q3337929) (← links)
- Scheduling task-tree with additive scales on parallel/distributed machines (Q6085760) (← links)