Extension of algorithm list scheduling for a semi-online scheduling problem

DOI10.1007/s10100-006-0003-xzbMath1158.90347OpenAlexW1980874942MaRDI QIDQ1011847

György Dósa, Yong He

Publication date: 14 April 2009

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0003-x

zbMATH Keywords

SchedulingCompetitive ratioAnalysis of algorithmSemi-online

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A survey on makespan minimization in semi-online environments

Cites Work

• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• The optimal on-line parallel machine scheduling
• Extending Graham's result on scheduling to other heuristics
• Semi-online algorithms for parallel machine scheduling problems
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
• On randomized online scheduling
• Better Bounds for Online Scheduling
• A Better Algorithm for an Ancient Scheduling Problem
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Extension of algorithm list scheduling for a semi-online scheduling problem