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

DOI10.1016/J.ORL.2023.09.010MaRDI QIDQ6556180FDOQ6556180

Authors: Jiří Sgall, Gerhard J. Woeginger 

Publication date: 17 June 2024

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

zbMATH Keywords

online algorithmspreemptionschedulingmakespanparallel jobs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Scheduling multiprocessor tasks -- An overview
• Scheduling with deadlines and loss functions
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling parallel jobs to minimize the makespan
• Title not available (Why is that?)
• Scheduling on semi-identical processors
• Online scheduling of parallel jobs with preemption on two identical machines
• On an on-line scheduling problem for parallel jobs
• Scheduling with unexpected machine breakdowns
• Scheduling uniform machines on-line requires nondecreasing speed ratios

Cited In (1)

• Online early work scheduling on parallel machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556180)