The following pages link to (Q4501555):
Displaying 13 items.
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← 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 proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
