Pages that link to "Item:Q2329473"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473):
Displaying 14 items.
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Approximation algorithms on multiple two-stage flowshops (Q1791041) (← links)
- Scheduling multiple two-stage flowshops with a deadline (Q2140576) (← links)
- Scheduling on multiple two-stage flowshops with a deadline (Q2151364) (← links)
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' (Q2357384) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- On scheduling multiple parallel two-stage flowshops with Johnson's rule (Q6197646) (← links)
- Applying Johnson's rule in scheduling multiple parallel two-stage flowshops (Q6535816) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops (Q6546990) (← links)
