A survey on makespan minimization in semi-online environments

Research output: Contribution to journalArticlepeer-review


We discuss variants of online scheduling on identical and uniformly related machines, where the objective is to minimize the makespan. All variants are such that some information regarding the input is provided in advance, and therefore these models are known as semi-online problems. Algorithms are analyzed with respect to the competitive ratio. We discuss the benefit arising from different kinds of available information and find that almost all variants allow one to reduce the competitive ratio significantly compared to the best possible competitive ratio for the corresponding pure online problem.

Original languageEnglish
Pages (from-to)269-284
Number of pages16
JournalJournal of Scheduling
Issue number3
StatePublished - 1 Jun 2018

Bibliographical note

Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.


  • Bin stretching
  • Competitive ratio
  • Known total size
  • Reassignment
  • Reordering buffers
  • Semi-online algorithms

ASJC Scopus subject areas

  • Software
  • General Engineering
  • Management Science and Operations Research
  • Artificial Intelligence


Dive into the research topics of 'A survey on makespan minimization in semi-online environments'. Together they form a unique fingerprint.

Cite this