Semi-on-line multiprocessor scheduling with given total processing time

Edwin Tai Chiu Cheng, Hans Kellerer, Vladimir Kotov

Research output: Journal article publicationJournal articleAcademic researchpeer-review

43 Citations (Scopus)


We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with performance ratio 1.625 for the less general problem that the optimal makespan is known in advance.
Original languageEnglish
Pages (from-to)134-146
Number of pages13
JournalTheoretical Computer Science
Issue number1-3
Publication statusPublished - 9 Jun 2005


  • Approximation algorithms
  • Bin stretching
  • Multiprocessor scheduling
  • On-line algorithms
  • Semi-on-line algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics


Dive into the research topics of 'Semi-on-line multiprocessor scheduling with given total processing time'. Together they form a unique fingerprint.

Cite this