Online Makespan Scheduling with Sublinear Advice
From MaRDI portal
Publication:5175103
DOI10.1007/978-3-662-46078-8_15zbMath1432.68589OpenAlexW985198747MaRDI QIDQ5175103
Publication date: 20 February 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/74233
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
A survey on makespan minimization in semi-online environments, A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey, Parallel solutions for preemptive makespan scheduling on two identical machines, Parallel solutions for ordinal scheduling with a small number of machines, Reordering buffer management with advice, Scheduling In the random-order model, Online algorithms with advice for bin packing and scheduling problems, The \(k\)-server problem with advice in \(d\) dimensions and on the sphere