Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
From MaRDI portal
Publication:6039898
DOI10.1016/j.tcs.2023.113937arXiv2204.01976MaRDI QIDQ6039898
Bin Fu, Yumei Huo, Hairong Zhao
Publication date: 23 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.01976
scheduling; parallel machines; total completion time; streaming algorithms; varying processing capacity
68Qxx: Theory of computing