Pages that link to "Item:Q5246814"
From MaRDI portal
The following pages link to Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814):
Displaying 14 items.
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← 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)
- 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)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← 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)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
