Pages that link to "Item:Q940887"
From MaRDI portal
The following pages link to On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887):
Displaying 9 items.
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)
