An FPTAS for the parallel two-stage flowshop problem
From MaRDI portal
(Redirected from Publication:507441)
dynamic programmingfully polynomial-time approximation schememakespanmultiprocessor schedulingtwo-stage flowshop scheduling
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Approximation algorithms for the parallel flow shop problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms for two-stage flexible flow shop scheduling
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Cites work
- A New Heuristic for Three-Machine Flow Shop Scheduling
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Algorithms for Scheduling Independent Tasks
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Approximability of flow shop scheduling
- Approximation algorithms for the parallel flow shop problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1500536 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Minimizing makespan in hybrid flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Short Shop Schedules
- The Complexity of Flowshop and Jobshop Scheduling
- The hybrid flow shop scheduling problem
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(29)- A multi-stage parallel-processor flowshop problem with minimum flowtime
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode
- On scheduling multiple two-stage flowshops
- Scheduling multiple two-stage flowshops with a deadline
- Scheduling on multiple two-stage flowshops with a deadline
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- Improved approximation algorithms for two-stage flowshops scheduling problem
- On scheduling inclined jobs on multiple two-stage flowshops
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- Scheduling two-stage jobs on multiple flowshops
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- Approximation algorithms for the parallel flow shop problem
- A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan
- On Approximation Algorithms for Two-Stage Scheduling Problems
- A review and classification on distributed permutation flowshop scheduling problems
- Maximizing total early work in a distributed two‐machine flow‐shop
- On scheduling multiple parallel two-stage flowshops with Johnson's rule
- Applying Johnson's rule in scheduling multiple parallel two-stage flowshops
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
- On online approximation algorithms for two-stage bins
- An efficient polynomial-time approximation scheme for parallel multi-stage open shops
- Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
- An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times
- Improved approximation algorithms for the multiple two-stage knapsack problem
This page was built for publication: An FPTAS for the parallel two-stage flowshop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507441)
