Online scheduling with interval conflicts

DOI10.1007/s00224-012-9408-1zbMath1310.68253OpenAlexW2041571304MaRDI QIDQ372978

Dror Rawitz, Boaz Patt-Shamir, Magnús M. Halldórsson

Publication date: 21 October 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3036/

zbMATH Keywords

competitive analysisdistributed algorithmsonline schedulingonline set packingcompound tasksinterval conflicts

Mathematics Subject Classification ID

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

Related Items (5)

Shrinking maxima, decreasing costs: new online packing and covering problems ⋮ A Randomized Algorithm for Online Scheduling with Interval Conflicts ⋮ Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Overflow management with self-eliminations ⋮ Overflow management with self-eliminations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive buffer management with packet dependencies
• Online Primal-Dual Algorithms for Covering and Packing
• Online Selection of Intervals and t-Intervals
• Online set packing and competitive scheduling of multi-part tasks
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Online scheduling with interval conflicts