Pages that link to "Item:Q1791041"
From MaRDI portal
The following pages link to Approximation algorithms on multiple two-stage flowshops (Q1791041):
Displaying 11 items.
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops (Q6546990) (← links)
