Pages that link to "Item:Q1280122"
From MaRDI portal
The following pages link to A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122):
Displaying 8 items.
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
