Approximation algorithms and a hardness result for the three-machine proportionate mixed shop

DOI10.1007/978-3-030-04618-7_22zbMath1522.90017OpenAlexW2901053464MaRDI QIDQ6073050

Guo-Hui Lin, Yue Luo, Longcheng Liu, Yong Chen, Randy Goebel, Guanqun Ni, An Zhang

Publication date: 16 October 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-04618-7_22

zbMATH Keywords

schedulingapproximation algorithmmixed shopfully polynomial-time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)