Pages that link to "Item:Q763116"
From MaRDI portal
The following pages link to A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116):
Displaying 3 items.
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)