Approximation algorithms for scheduling multiple two-stage flowshops

DOI10.1007/978-3-319-62389-4_43zbMath1433.68615OpenAlexW2726382605MaRDI QIDQ2412433

Jianxin Wang, Guangwei Wu

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_43

zbMATH Keywords

schedulingapproximation algorithmcloud computingmultiple 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 (2)

On scheduling multiple two-stage flowshops ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

This page was built for publication: Approximation algorithms for scheduling multiple two-stage flowshops