The following pages link to (Q5453295):
Displaying 7 items.
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- The two-machine open shop problem: To fit or not to fit, that is the question (Q1811630) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
- Characteristics of machine order matrix of open shop scheduling problems (Q2868000) (← links)
- Stochastic scheduling for a two-machine open shop (Q4364879) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)