Online minimum makespan scheduling with a buffer

Yan Lan, Xin Chen, Ning Ding, G. Dósa, Xin Han

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m, which is better than the previous best result: 1.5-competitive algorithm with a buffer of size 1.6197m; ii) for three identical machines, to give an optimal online algorithm we reduce the size of the buffer from nine to six; iii) for m uniform machines, using a buffer of size m, we improve the competitive ratio from 2 + ε to 2-1/m + ε, where ε > 0 is sufficiently small.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages161-171
Number of pages11
Volume7285 LNCS
DOIs
Publication statusPublished - 2012
Event6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012 - Beijing, China
Duration: May 14 2012May 16 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7285 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012
CountryChina
CityBeijing
Period5/14/125/16/12

Fingerprint

Buffer
Scheduling
Online Algorithms
Uniform Machines
Reordering
Competitive Ratio
Optimal Algorithm
Scheduling Problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lan, Y., Chen, X., Ding, N., Dósa, G., & Han, X. (2012). Online minimum makespan scheduling with a buffer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7285 LNCS, pp. 161-171). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7285 LNCS). https://doi.org/10.1007/978-3-642-29700-7_15

Online minimum makespan scheduling with a buffer. / Lan, Yan; Chen, Xin; Ding, Ning; Dósa, G.; Han, Xin.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7285 LNCS 2012. p. 161-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7285 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lan, Y, Chen, X, Ding, N, Dósa, G & Han, X 2012, Online minimum makespan scheduling with a buffer. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7285 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7285 LNCS, pp. 161-171, 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012, Beijing, China, 5/14/12. https://doi.org/10.1007/978-3-642-29700-7_15
Lan Y, Chen X, Ding N, Dósa G, Han X. Online minimum makespan scheduling with a buffer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7285 LNCS. 2012. p. 161-171. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-29700-7_15
Lan, Yan ; Chen, Xin ; Ding, Ning ; Dósa, G. ; Han, Xin. / Online minimum makespan scheduling with a buffer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7285 LNCS 2012. pp. 161-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4f7eeae4caca434bac3ad3a052b1e472,
title = "Online minimum makespan scheduling with a buffer",
abstract = "In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m, which is better than the previous best result: 1.5-competitive algorithm with a buffer of size 1.6197m; ii) for three identical machines, to give an optimal online algorithm we reduce the size of the buffer from nine to six; iii) for m uniform machines, using a buffer of size m, we improve the competitive ratio from 2 + ε to 2-1/m + ε, where ε > 0 is sufficiently small.",
author = "Yan Lan and Xin Chen and Ning Ding and G. D{\'o}sa and Xin Han",
year = "2012",
doi = "10.1007/978-3-642-29700-7_15",
language = "English",
isbn = "9783642296994",
volume = "7285 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "161--171",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Online minimum makespan scheduling with a buffer

AU - Lan, Yan

AU - Chen, Xin

AU - Ding, Ning

AU - Dósa, G.

AU - Han, Xin

PY - 2012

Y1 - 2012

N2 - In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m, which is better than the previous best result: 1.5-competitive algorithm with a buffer of size 1.6197m; ii) for three identical machines, to give an optimal online algorithm we reduce the size of the buffer from nine to six; iii) for m uniform machines, using a buffer of size m, we improve the competitive ratio from 2 + ε to 2-1/m + ε, where ε > 0 is sufficiently small.

AB - In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m, which is better than the previous best result: 1.5-competitive algorithm with a buffer of size 1.6197m; ii) for three identical machines, to give an optimal online algorithm we reduce the size of the buffer from nine to six; iii) for m uniform machines, using a buffer of size m, we improve the competitive ratio from 2 + ε to 2-1/m + ε, where ε > 0 is sufficiently small.

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

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

U2 - 10.1007/978-3-642-29700-7_15

DO - 10.1007/978-3-642-29700-7_15

M3 - Conference contribution

SN - 9783642296994

VL - 7285 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 161

EP - 171

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -