On Approximation Algorithms for Two-Stage Scheduling Problems

DOI10.1007/978-3-319-59605-1_22zbMath1429.90031OpenAlexW2617757968MaRDI QIDQ4632219

Jianxin Wang, Guangwei Wu, Jian'er Chen

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_22

zbMATH Keywords

competitive ratioonline algorithmcompletion timeonline schedulingapproximation ratio

Mathematics Subject Classification ID

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

Related Items (max. 100)

A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem
• New algorithms for an ancient scheduling problem.
• Scheduling two-stage jobs on multiple flowshops
• 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 Approximation Algorithms for Two-Stage Scheduling Problems