Pages that link to "Item:Q1761791"
From MaRDI portal
The following pages link to New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791):
Displaying 4 items.
- On the set of solutions of the open shop problem (Q1960322) (← 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)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)