Semi-online algorithms for parallel machine scheduling problems

G. Dósa, Y. He

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

This paper considers two semi-online versions of scheduling problem P2∥C max where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.

Original languageEnglish
Pages (from-to)355-363
Number of pages9
JournalComputing
Volume72
Issue number3-4
Publication statusPublished - 2004

Fingerprint

Parallel Machine Scheduling
Online Algorithms
Scheduling Problem
Competitive Ratio
Scheduling
Optimal Algorithm
Buffer
Parallel Processors
Partial Information

Keywords

  • Approximation algorithm
  • Competitive analysis
  • Scheduling
  • Semi-online

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Semi-online algorithms for parallel machine scheduling problems. / Dósa, G.; He, Y.

In: Computing, Vol. 72, No. 3-4, 2004, p. 355-363.

Research output: Contribution to journalArticle

Dósa, G. ; He, Y. / Semi-online algorithms for parallel machine scheduling problems. In: Computing. 2004 ; Vol. 72, No. 3-4. pp. 355-363.
@article{acf9edd066584ca79b28dc3545487229,
title = "Semi-online algorithms for parallel machine scheduling problems",
abstract = "This paper considers two semi-online versions of scheduling problem P2∥C max where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.",
keywords = "Approximation algorithm, Competitive analysis, Scheduling, Semi-online",
author = "G. D{\'o}sa and Y. He",
year = "2004",
language = "English",
volume = "72",
pages = "355--363",
journal = "Computing (Vienna/New York)",
issn = "0010-485X",
publisher = "Springer Wien",
number = "3-4",

}

TY - JOUR

T1 - Semi-online algorithms for parallel machine scheduling problems

AU - Dósa, G.

AU - He, Y.

PY - 2004

Y1 - 2004

N2 - This paper considers two semi-online versions of scheduling problem P2∥C max where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.

AB - This paper considers two semi-online versions of scheduling problem P2∥C max where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.

KW - Approximation algorithm

KW - Competitive analysis

KW - Scheduling

KW - Semi-online

UR - http://www.scopus.com/inward/record.url?scp=3042747137&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042747137&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:3042747137

VL - 72

SP - 355

EP - 363

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 3-4

ER -