Online makespan scheduling with sublinear advice

DOI10.1007/978-3-662-46078-8_15MaRDI QIDQ5175103zbMATH OpenOpenAlexFDO

Authors Jérôme Dohrau

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

zbMATH Keywords

advice complexitymakespan schedulingonline algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online algorithms with advice for bin packing and scheduling problems
• On the Advice Complexity of Online Problems
• Advice complexity of fine-grained job shop scheduling
• Online algorithms with advice: the tape model

Cited in

(14)

• A survey on makespan minimization in semi-online environments
• Reordering buffer management with advice
• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
• Scheduling In the random-order model
• A technique to obtain hardness results for randomized online algorithms -- a survey
• Advice complexity of fine-grained job shop scheduling
• scientific article; zbMATH DE number 5670142 (Why is no real title available?)
• Online algorithms with advice for bin packing and scheduling problems
• Parallel solutions for preemptive makespan scheduling on two identical machines
• Parallel solutions for ordinal scheduling with a small number of machines
• Scheduling in the random-order model
• Improved online load balancing with known makespan
• Semi-online models for cardinality constrained bin packing
• Online makespan minimization with budgeted uncertainty

This page was built for publication: Online makespan scheduling with sublinear advice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175103)