A Randomized Algorithm for Online Scheduling with Interval Conflicts

DOI10.1007/978-3-319-25258-2_7zbMath1471.68325OpenAlexW2295507491MaRDI QIDQ3460709

Artur Kraska, Paweł Schmidt, Marcin Bienkowski

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_7

zbMATH Keywords

competitive analysisonline algorithmsonline schedulinginterval conflicts

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online scheduling with interval conflicts
• Online selection of intervals and \(t\)-intervals
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• Efficient On-Line Call Control Algorithms
• Online set packing and competitive scheduling of multi-part tasks

This page was built for publication: A Randomized Algorithm for Online Scheduling with Interval Conflicts