Online interval scheduling to maximize total satisfaction

DOI10.1016/j.tcs.2019.10.046zbMath1436.90052arXiv1805.05436OpenAlexW2983790463WikidataQ126840925 ScholiaQ126840925MaRDI QIDQ2285162

Koji M. Kobayashi

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.05436

zbMATH Keywords

best-effort servicecompetitive analysisonline algorithmscheduling probleminterval scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On-line scheduling of equal-length intervals on parallel machines
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Improved randomized results for the interval selection problem
• Online interval scheduling: Randomized and multiprocessor cases
• Scheduling jobs with fixed start and end times
• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• Note on scheduling intervals on-line
• On the \(k\)-coloring of intervals
• Improved randomized online scheduling of intervals and jobs
• An improved randomized on-line algorithm for a weighted interval selection problem
• Interval scheduling on identical machines
• Interval scheduling: A survey
• Bounding the Power of Preemption in Randomized Scheduling
• The Power of Migration for Online Slack Scheduling.

This page was built for publication: Online interval scheduling to maximize total satisfaction