On-line scheduling of equal-length intervals on parallel machines

DOI10.1016/J.IPL.2012.01.015zbMath1243.68328OpenAlexW2046446291MaRDI QIDQ436333

Chung Keung Poon, Stanley P. Y. Fung, Duncan K. W. Yung

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.015

zbMATH Keywords

competitive analysison-line algorithminterval schedulingparallel scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Online interval scheduling on two related machines: the power of lookahead ⋮ Online C-benevolent job scheduling on multiple machines ⋮ An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead ⋮ Online interval scheduling to maximize total satisfaction ⋮ Online scheduling of jobs with fixed start times on related machines

Cites Work

• Unnamed Item
• Unnamed Item
• Interval scheduling on related machines
• Improved randomized results for the interval selection problem
• Online interval scheduling: Randomized and multiprocessor cases
• On-line scheduling of jobs with fixed start and end times
• Note on scheduling intervals on-line
• Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
• Bounding the Power of Preemption in Randomized Scheduling

This page was built for publication: On-line scheduling of equal-length intervals on parallel machines