On scheduling multiple two-stage flowshops

DOI10.1016/j.tcs.2018.04.017zbMath1440.68032OpenAlexW2800969819MaRDI QIDQ1985613

Jianxin Wang, Guangwei Wu, Jian'er Chen

Publication date: 7 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.017

zbMATH Keywords

schedulingapproximation algorithmsmultiple two-stage flowshops

Mathematics Subject Classification ID

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

Related Items

Scheduling multiple two-stage flowshops with a deadline ⋮ Scheduling on multiple two-stage flowshops with a deadline ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ On scheduling multiple parallel two-stage flowshops with Johnson's rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem
• A comprehensive review and evaluation of permutation flowshop heuristics
• The hybrid flow shop scheduling problem
• Approximation algorithms for scheduling multiple two-stage flowshops
• Scheduling two-stage jobs on multiple flowshops
• Optimal two- and three-stage production schedules with setup times included
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies