Improved approximation algorithms for two-stage flowshops scheduling problem
DOI10.1016/J.TCS.2019.08.028zbMATH Open1436.68400OpenAlexW2970302286MaRDI QIDQ2285149FDOQ2285149
Authors: Guangwei Wu, Jianxin Wang, Jianer Chen 
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.028
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- Algorithms for Scheduling Independent Tasks
- Parameterized algorithms
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- An Application of Bin-Packing to Multiprocessor Scheduling
- Title not available (Why is that?)
- Scheduling independent tasks to reduce mean finishing time
- Approximation algorithms for the parallel flow shop problem
- Parameterized computational complexity of Dodgson and Young elections
- Scheduling meets \(n\)-fold integer programming
- An FPTAS for the parallel two-stage flowshop problem
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Approximating maximum agreement forest on multiple binary trees
- Scheduling and fixed-parameter tractability
- Scheduling two-stage jobs on multiple flowshops
- Scheduling. Theory, algorithms, and systems
- Approximation algorithms on multiple two-stage flowshops
- Parameterized and approximation results for scheduling with a low rank processing time matrix
- Improved PTAS for the constrained \(k\)-means problem
Cited In (19)
- Title not available (Why is that?)
- An improved two-machine flowshop scheduling with intermediate transportation
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- 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
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- A data intensive heuristic approach to the two-stage streaming scheduling 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: 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)
