Pages that link to "Item:Q1306353"
From MaRDI portal
The following pages link to Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353):
Displaying 14 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
