Pages that link to "Item:Q5246814"

The following pages link to Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814):

Displaying 7 items.

• 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)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Some positive news on the proportionate open shop problem (Q2633607) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
• On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)