Pages that link to "Item:Q1960322"
From MaRDI portal
The following pages link to On the set of solutions of the open shop problem (Q1960322):
Displaying 4 items.
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← 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)
