Pages that link to "Item:Q3468873"
From MaRDI portal
The following pages link to Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873):
Displaying 5 items.
- Scenario based robust line balancing: Computational complexity (Q442208) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356) (← links)
- Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair (Q4016951) (← links)
- Tight performance bounds of CP-scheduling on out-trees (Q5952053) (← links)