Pages that link to "Item:Q2292124"
From MaRDI portal
The following pages link to Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124):
Displaying 20 items.
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
- Approximation algorithms on multiple two-stage flowshops (Q1791041) (← links)
- Improved approximation algorithms for two-stage flexible flow shop scheduling (Q2025092) (← links)
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← 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)
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- An improved algorithm for a hybrid flow-shop problem in graphics processing (Q2917111) (← links)
- (Q3641987) (← links)
- A computational study of heuristics for two-stage flexible flowshops (Q4230155) (← links)
- Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops (Q4487091) (← links)
- (Q4508364) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility (Q4651708) (← links)
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)