Pages that link to "Item:Q2391177"
From MaRDI portal
The following pages link to Scheduling on unrelated machines under tree-like precedence constraints (Q2391177):
Displaying 9 items.
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- The power of preemption on unrelated machines and applications to scheduling orders (Q5891554) (← links)