Lower bound for on-line scheduling on uniformly related machines

Leah Epstein, Jiří Sgall

Research output: Contribution to journalArticlepeer-review


We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

Original languageEnglish
Article number1281
Pages (from-to)17-22
Number of pages6
JournalOperations Research Letters
Issue number1
StatePublished - 2000
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'Lower bound for on-line scheduling on uniformly related machines'. Together they form a unique fingerprint.

Cite this