A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). Previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer based search through the graph of possible states of an algorithm in the previous work.
KeywordsCompetitive Ratio Online Algorithm List Schedule Online Schedule Common Ratio
Unable to display preview. Download preview PDF.
- 7.Ebenlendr, T.: Combinatorial algorithms for online problems: Semi-online scheduling on related machines. PhD thesis, Charles University, Prague (2011)Google Scholar