Pages that link to "Item:Q2633607"
From MaRDI portal
The following pages link to Some positive news on the proportionate open shop problem (Q2633607):
Displaying 5 items.
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
