Priority algorithms for makespan minimization in the subset model

Research output: Contribution to journalArticle

Abstract

We continue the recent study of priority algorithms initiated by Borodin et al. [Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 752-761]. The definition of a priority algorithm nicely captures the idea of a "greedy-like" type algorithm. While priority algorithms are applicable to many optimization problems, in this paper we consider the problem of makespan minimization in scheduling in the subset model. We show that by using a fixed priority algorithm one cannot achieve a considerable improvement over the approximation ratio given by the online greedy algorithm. Namely, we present an Ω(logm/loglogm) lower bound on the approximation ratio of any fixed priority algorithm where m is the number of machines.

Original languageEnglish (US)
Pages (from-to)153-157
Number of pages5
JournalInformation Processing Letters
Volume84
Issue number3
DOIs
StatePublished - Nov 15 2002

Fingerprint

Set theory
Subset
Model
Online Algorithms
Approximation
Greedy Algorithm
Continue
Scheduling
Lower bound
Optimization Problem

Keywords

  • Approximation algorithms
  • Scheduling

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Priority algorithms for makespan minimization in the subset model. / Regev, Oded.

In: Information Processing Letters, Vol. 84, No. 3, 15.11.2002, p. 153-157.

Research output: Contribution to journalArticle

@article{035bc449f6d644b3a3138ec93a7dc7fa,
title = "Priority algorithms for makespan minimization in the subset model",
abstract = "We continue the recent study of priority algorithms initiated by Borodin et al. [Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 752-761]. The definition of a priority algorithm nicely captures the idea of a {"}greedy-like{"} type algorithm. While priority algorithms are applicable to many optimization problems, in this paper we consider the problem of makespan minimization in scheduling in the subset model. We show that by using a fixed priority algorithm one cannot achieve a considerable improvement over the approximation ratio given by the online greedy algorithm. Namely, we present an Ω(logm/loglogm) lower bound on the approximation ratio of any fixed priority algorithm where m is the number of machines.",
keywords = "Approximation algorithms, Scheduling",
author = "Oded Regev",
year = "2002",
month = "11",
day = "15",
doi = "10.1016/S0020-0190(02)00264-8",
language = "English (US)",
volume = "84",
pages = "153--157",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Priority algorithms for makespan minimization in the subset model

AU - Regev, Oded

PY - 2002/11/15

Y1 - 2002/11/15

N2 - We continue the recent study of priority algorithms initiated by Borodin et al. [Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 752-761]. The definition of a priority algorithm nicely captures the idea of a "greedy-like" type algorithm. While priority algorithms are applicable to many optimization problems, in this paper we consider the problem of makespan minimization in scheduling in the subset model. We show that by using a fixed priority algorithm one cannot achieve a considerable improvement over the approximation ratio given by the online greedy algorithm. Namely, we present an Ω(logm/loglogm) lower bound on the approximation ratio of any fixed priority algorithm where m is the number of machines.

AB - We continue the recent study of priority algorithms initiated by Borodin et al. [Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 752-761]. The definition of a priority algorithm nicely captures the idea of a "greedy-like" type algorithm. While priority algorithms are applicable to many optimization problems, in this paper we consider the problem of makespan minimization in scheduling in the subset model. We show that by using a fixed priority algorithm one cannot achieve a considerable improvement over the approximation ratio given by the online greedy algorithm. Namely, we present an Ω(logm/loglogm) lower bound on the approximation ratio of any fixed priority algorithm where m is the number of machines.

KW - Approximation algorithms

KW - Scheduling

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

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

U2 - 10.1016/S0020-0190(02)00264-8

DO - 10.1016/S0020-0190(02)00264-8

M3 - Article

AN - SCOPUS:0037110728

VL - 84

SP - 153

EP - 157

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 3

ER -