Approximation algorithms for two-stage flexible flow shop scheduling
From MaRDI portal
(Redirected from Publication:2292124)
Recommendations
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- Approximation algorithms for scheduling multiple two-stage flowshops
- Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines
- Improved approximation algorithms for two-stage flowshops scheduling problem
- Approximation algorithms on multiple two-stage flowshops
- Approximation algorithms for a two-stage hybrid flow shop
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- scientific article; zbMATH DE number 784425
- scientific article; zbMATH DE number 5631252
Cites work
- scientific article; zbMATH DE number 3466794 (Why is no real title available?)
- scientific article; zbMATH DE number 7390047 (Why is no real title available?)
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Approximation algorithms for scheduling parallel jobs
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Minimizing makespan in hybrid flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling multiprocessor tasks -- An overview
- Two-stage flexible flowshop scheduling problems with a batch processor on second stage
- Two-stage proportionate flexible flow shop to minimize the makespan
Cited in
(24)- scientific article; zbMATH DE number 1979499 (Why is no real title available?)
- scientific article; zbMATH DE number 1512677 (Why is no real title available?)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- An improved algorithm for a hybrid flow-shop problem in graphics processing
- Efficient algorithms for flexible job shop scheduling with parallel machines
- On Approximation Algorithms for Two-Stage Scheduling Problems
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Approximation algorithms for scheduling multiple two-stage flowshops
- A computational study of heuristics for two-stage flexible flowshops
- Approximation algorithms for a two-stage hybrid flow shop
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
- Improved approximation algorithms for two-stage flowshops scheduling problem
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- On scheduling multiple parallel two-stage flowshops with Johnson's rule
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility
- Approximability of flow shop scheduling
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
- scientific article; zbMATH DE number 5631252 (Why is no real title available?)
- An FPTAS for the parallel two-stage flowshop problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms on multiple two-stage flowshops
This page was built for publication: Approximation algorithms for two-stage flexible flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292124)
