The following pages link to (Q4882995):
Displaying 4 items.
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
