The on-line multiprocessor scheduling problem with known sum of the tasks

E. Angelelli, Á B. Nagy, M. G. Speranza, Z. S. Tuza

Research output: Contribution to journalArticle

21 Citations (Scopus)


In this paper we investigate a semi on-line multiprocessor scheduling problem. The problem is the classical on-line multiprocessor problem where the total sum of the tasks is known in advance. We show an asymptotic lower bound on the performance ratio of any algorithm (as the number of processors gets large), and present an algorithm which has performance ratio at most √6+1/2 < 1.725 for any number of processors. When compared with known general lower bounds, this result indicates that the information on the sum of tasks substantially improves the performance ratio of on-line algorithms.

Original languageEnglish
Pages (from-to)421-428
Number of pages8
JournalJournal of Scheduling
Issue number6
Publication statusPublished - Nov 1 2004


  • Competitive analysis
  • On-line scheduling
  • Parallel processors

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'The on-line multiprocessor scheduling problem with known sum of the tasks'. Together they form a unique fingerprint.

  • Cite this