Pages that link to "Item:Q507441"
From MaRDI portal
The following pages link to An FPTAS for the parallel two-stage flowshop problem (Q507441):
Displaying 24 items.
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- Scheduling multiple two-stage flowshops with a deadline (Q2140576) (← links)
- Scheduling on multiple two-stage flowshops with a deadline (Q2151364) (← 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)
- On scheduling inclined jobs on multiple two-stage flowshops (Q2319904) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' (Q2357384) (← links)
- Scheduling two-stage jobs on multiple flowshops (Q2419124) (← 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 FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← 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)
