On scheduling inclined jobs on multiple two-stage flowshops

DOI10.1016/j.tcs.2018.04.005zbMath1429.90032OpenAlexW2802259763MaRDI QIDQ2319904

Guangwei Wu, Jianxin Wang, Jian'er Chen

Publication date: 20 August 2019

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

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

zbMATH Keywords

schedulingonline algorithmsapproximation algorithmscloud computingmultiple two-stage flowshops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (4)

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
• 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
• Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
• Scheduling two-stage jobs on multiple flowshops
• Optimal two- and three-stage production schedules with setup times included
• The Design of Approximation Algorithms
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Better Bounds for Online Scheduling
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Scheduling

This page was built for publication: On scheduling inclined jobs on multiple two-stage flowshops