Improved approximation algorithms for two-stage flowshops scheduling problem

DOI10.1016/j.tcs.2019.08.028zbMath1436.68400MaRDI QIDQ2285149

Jianxin Wang, Jian'er Chen, Guangwei Wu

Publication date: 16 January 2020

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

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

zbMATH Keywords

scheduling; approximation algorithm; makespan; flowshops

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W25: Approximation algorithms