Fast approximation algorithms for uniform machine scheduling with processing set restrictions
From MaRDI portal
Publication:1753462
DOI10.1016/j.ejor.2017.01.013zbMath1403.90342MaRDI QIDQ1753462
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.013
scheduling; makespan; uniform machines; inclusive processing set; tree-hierarchical processing set; worst-case bound
90B35: Deterministic scheduling theory in operations research