Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms

DOI10.1007/978-3-319-18263-6_20zbMath1457.68319OpenAlexW212211351MaRDI QIDQ3453298

Jiří Sgall, Gerhard J. Woeginger

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18263-6_20

Mathematics Subject Classification ID

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

Cites Work

• Scheduling parallel jobs to minimize the makespan
• Scheduling multiprocessor tasks -- An overview
• Scheduling uniform machines on-line requires nondecreasing speed ratios
• On an on-line scheduling problem for parallel jobs
• On the complexity of multiprocessor task scheduling
• Online scheduling of parallel jobs with preemption on two identical machines
• Scheduling with Deadlines and Loss Functions
• Scheduling on semi-identical processors
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling with unexpected machine breakdowns