Pages that link to "Item:Q6102847"
From MaRDI portal
The following pages link to Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847):
Displaying 8 items.
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Discrete parallel machine makespan ScheLoc problem (Q1679512) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- (Q5702311) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
- Online early work scheduling on parallel machines (Q6586214) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)