Improved approximation algorithms for two-stage flowshops scheduling problem

DOI10.1016/J.TCS.2019.08.028MaRDI QIDQ2285149zbMATHOpenAlexFDO

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

zbMATH Keywords

approximation algorithmschedulingmakespanflowshops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms on multiple two-stage flowshops
• Approximation algorithms for two-stage flexible flow shop scheduling
• Approximation algorithms for scheduling multiple two-stage flowshops
• On scheduling multiple two-stage flowshops
• Approximation algorithms for the parallel flow shop problem

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)

• An improved algorithm for a hybrid flow-shop problem in graphics processing
• Scheduling multiple two-stage flowshops with a deadline
• A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
• On scheduling multiple two-stage flowshops
• Approximation algorithms on multiple two-stage flowshops
• 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
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
• On Approximation Algorithms for Two-Stage Scheduling Problems
• Scheduling on multiple two-stage flowshops with a deadline
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
• scientific article; zbMATH DE number 1979499 (Why is no real title available?)
• Improved approximation algorithms for two-stage flexible flow shop scheduling
• Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines
• Improved Approximation Algorithms for Routing Shop Scheduling
• On scheduling multiple parallel two-stage flowshops with Johnson's rule
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• Approximation algorithms for a two-stage hybrid flow shop
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
• Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
• Approximation algorithms for two-stage flexible flow shop scheduling
• Approximation algorithms for scheduling multiple two-stage flowshops
• An improved two-machine flowshop scheduling with intermediate transportation
• Approximation algorithms for the parallel flow shop problem

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)