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 (Vienna/New York)
Volume72
Issue number3-4
Publication statusPublished - Jul 19 2004

Keywords

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

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Semi-online algorithms for parallel machine scheduling problems'. Together they form a unique fingerprint.

  • Cite this