Improved approximation algorithms for two-stage flowshops scheduling problem
From MaRDI portal
(Redirected from Publication:2285149)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Algorithms for Scheduling Independent Tasks
- An Application of Bin-Packing to Multiprocessor Scheduling
- An FPTAS for the parallel two-stage flowshop problem
- Approximating maximum agreement forest on multiple binary trees
- Approximation algorithms for the parallel flow shop problem
- Approximation algorithms on multiple two-stage flowshops
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Improved PTAS for the constrained \(k\)-means problem
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized algorithms
- Parameterized and approximation results for scheduling with a low rank processing time matrix
- Parameterized computational complexity of Dodgson and Young elections
- Scheduling and fixed-parameter tractability
- Scheduling independent tasks to reduce mean finishing time
- Scheduling meets n-fold integer programming
- Scheduling two-stage jobs on multiple flowshops
- Scheduling. Theory, algorithms, and systems
Cited in
(24)- scientific article; zbMATH DE number 1979499 (Why is no real title available?)
- An improved two-machine flowshop scheduling with intermediate transportation
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- 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
- On scheduling multiple two-stage flowshops
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- An improved algorithm for a hybrid flow-shop problem in graphics processing
- On Approximation Algorithms for Two-Stage Scheduling Problems
- Approximation algorithms for two-stage flexible flow shop scheduling
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- Approximation algorithms for scheduling multiple two-stage flowshops
- Scheduling on multiple two-stage flowshops with a deadline
- Approximation algorithms for the parallel flow shop problem
- Scheduling multiple two-stage flowshops with a deadline
- Approximation algorithms for a two-stage hybrid flow shop
- Improved Approximation Algorithms for Routing Shop Scheduling
- On scheduling multiple parallel two-stage flowshops with Johnson's rule
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- A data intensive heuristic approach to the two-stage streaming scheduling problem
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms on multiple two-stage flowshops
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
This page was built for publication: Improved approximation algorithms for two-stage flowshops scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285149)
