The following pages link to Scheduling ordered open shops (Q580167):
Displayed 9 items.
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Open shop scheduling with maximal machines (Q1377665) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Flow shop and open shop scheduling with a critical machine and two operations per job (Q1590807) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Two-machine open shop scheduling with secondary criteria (Q3044040) (← links)