Semi on-line scheduling on three processors with known sum of the tasks

DOI10.1007/s10951-007-0023-yzbMath1168.90417OpenAlexW2119597831MaRDI QIDQ835557

Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0023-y

zbMATH Keywords

competitive analysisparallel processorssemi on-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on makespan minimization in semi-online environments, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence, Semi-online scheduling: a survey, Semi-online scheduling problems on a small number of machines, Online early work maximization on three hierarchical machines with a common due date, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

Cites Work

• Unnamed Item
• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• On-line scheduling revisited
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• The on-line multiprocessor scheduling problem with known sum of the tasks
• Better Bounds for Online Scheduling
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks