Pages that link to "Item:Q6161912"
From MaRDI portal
The following pages link to On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912):
Displaying 6 items.
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)
- The power of preemption on unrelated machines and applications to scheduling orders (Q5891554) (← links)