Online scheduling of jobs with fixed start times on related machines

DOI10.1007/s00453-014-9940-2zbMath1333.90040OpenAlexW2136848105WikidataQ59473315 ScholiaQ59473315MaRDI QIDQ261353

Łukasz Jeż, Rob van Stee, Leah Epstein, Jiří Sgall

Publication date: 23 March 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9940-2

zbMATH Keywords

online algorithmsonline schedulingrelated machines

Mathematics Subject Classification ID

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

Related Items (5)

Scheduling Multipacket Frames with Frame Deadlines ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Scheduling multipacket frames with frame deadlines ⋮ Improved bounds for randomized preemptive online matching ⋮ Online C-benevolent job scheduling on multiple machines

Cites Work

• Unnamed Item
• On-line scheduling of equal-length intervals on parallel machines
• Interval scheduling on related machines
• Improved randomized results for the interval selection problem
• Online interval scheduling: Randomized and multiprocessor cases
• On the competitiveness of on-line real-time task scheduling
• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• On-line scheduling with tight deadlines.
• Note on scheduling intervals on-line
• On the \(k\)-coloring of intervals
• Improved randomized online scheduling of intervals and jobs
• Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
• Bounding the Power of Preemption in Randomized Scheduling
• Speed is as powerful as clairvoyance

This page was built for publication: Online scheduling of jobs with fixed start times on related machines