A randomized algorithm for online scheduling with interval conflicts

DOI10.1007/978-3-319-25258-2_7MaRDI QIDQ3460709zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Artur Kraska, Paweł Schmidt

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

online algorithmscompetitive analysisonline schedulinginterval conflicts

Mathematics Subject Classification ID

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

Recommendations

• Online scheduling with interval conflicts
• Online scheduling with interval conflicts
• Online Interval Scheduling: Randomized and Multiprocessor Cases
• scientific article; zbMATH DE number 1003261
• Online interval scheduling: Randomized and multiprocessor cases

Cites work

• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Efficient On-Line Call Control Algorithms
• Online scheduling with interval conflicts
• Online selection of intervals and t-intervals
• Online set packing and competitive scheduling of multi-part tasks
• Randomized competitive algorithms for the list update problem
• Two results on the list update problem

Cited in

(6)

• Online interval scheduling: Randomized and multiprocessor cases
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• Online scheduling with interval conflicts
• A note on the online interval scheduling secretary problem
• Online scheduling with interval conflicts
• An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts

This page was built for publication: A randomized algorithm for online scheduling with interval conflicts

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