Pages that link to "Item:Q1333531"
From MaRDI portal
The following pages link to On the complexity of preemptive openshop scheduling problems (Q1333531):
Displaying 4 items.
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- Open shops with jobs overlap (Q1319530) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
