Approximation algorithms for parallel open shop scheduling

DOI10.1016/j.ipl.2013.01.009zbMath1259.68235OpenAlexW2029704020MaRDI QIDQ1943639

An Zhang, Guangting Chen, Yong Chen, Jianming Dong

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.009

zbMATH Keywords

approximation algorithmopen shopworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Related Items (3)

Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops

This page was built for publication: Approximation algorithms for parallel open shop scheduling