Pages that link to "Item:Q703917"
From MaRDI portal
The following pages link to On the open-shop problem with preemption and minimizing the average completion time (Q703917):
Displaying 6 items.
- On the solution region for certain scheduling problems with preemption (Q1273129) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Time buffers in the open shop problem (Q2786901) (← links)