Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms

DOI10.1016/j.orl.2023.09.010MaRDI QIDQ6556180

Gerhard J. Woeginger, Jiří Sgall

Publication date: 17 June 2024

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

schedulingonline algorithmsmakespanpreemptionparallel jobs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• 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
• 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

Related Items (1)

Online early work scheduling on parallel machines

This page was built for publication: Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms