Online scheduling of splittable tasks

DOI10.1145/1125994.1125999zbMath1321.68118OpenAlexW2131283467MaRDI QIDQ2944507

Rob van Stee, Leah Epstein

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/74/

zbMATH Keywords

schedulingonline algorithmssplittable tasks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Competitive analysis of the online inventory problem

This page was built for publication: Online scheduling of splittable tasks