Pages that link to "Item:Q2672605"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605):
Displaying 5 items.
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← 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)
- 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)