Geometric representation for semi on-line scheduling on uniform processors

Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The problem of semi on-line scheduling on two uniform processors is considered, in the case where the total sum of the tasks is known in advance. The speed of the slow processor is normalized to 1, and the fast one is supposed to have speed s ≥ 1. A task of size p requires processing time p or p/s, depending on whether it is assigned to the slow or fast processor. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is to minimize the makespan. We develop a geometric representation, parametrized with s, that can be applied to improve on the currently known best bounds on the competitive ratio of semi on-line scheduling algorithms.

Original languageEnglish
Pages (from-to)421-428
Number of pages8
JournalOptimization Methods and Software
Volume25
Issue number3
DOIs
Publication statusPublished - Jun 1 2010

Keywords

  • Competitive analysis
  • Semi on-line scheduling
  • Uniform processors

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Geometric representation for semi on-line scheduling on uniform processors'. Together they form a unique fingerprint.

  • Cite this