The following pages link to (Q4952712):
Displayed 5 items.
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)