Tight upper bounds for semi-online scheduling on two uniform machines with known optimum

G. Dósa, Armin Fügenschuh, Zhiyi Tan, Z. Tuza, Krzysztof Węsek

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worst-case ratio of the solution given by an algorithm in comparison to the optimal offline solution. In this paper, we make a further step towards completing the answer to this question by determining the optimal competitive ratio for s between 5+24112≈1.7103 and 3≈1.7321, one of the intervals that were still open. Namely, we present and analyze a compound algorithm achieving the previously known lower bounds.

Original languageEnglish
Pages (from-to)161-180
Number of pages20
JournalCentral European Journal of Operations Research
Volume26
Issue number1
DOIs
Publication statusPublished - Mar 1 2018

Fingerprint

Upper bound
Makespan
Competitive ratio
Optimal solution
Assignment
Lower bounds

Keywords

  • Makespan minimization
  • Mixed-integer linear programming
  • Scheduling
  • Semi-online algorithm

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. / Dósa, G.; Fügenschuh, Armin; Tan, Zhiyi; Tuza, Z.; Węsek, Krzysztof.

In: Central European Journal of Operations Research, Vol. 26, No. 1, 01.03.2018, p. 161-180.

Research output: Contribution to journalArticle

@article{bc5285df1db14a58bb084807a771b35f,
title = "Tight upper bounds for semi-online scheduling on two uniform machines with known optimum",
abstract = "We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worst-case ratio of the solution given by an algorithm in comparison to the optimal offline solution. In this paper, we make a further step towards completing the answer to this question by determining the optimal competitive ratio for s between 5+24112≈1.7103 and 3≈1.7321, one of the intervals that were still open. Namely, we present and analyze a compound algorithm achieving the previously known lower bounds.",
keywords = "Makespan minimization, Mixed-integer linear programming, Scheduling, Semi-online algorithm",
author = "G. D{\'o}sa and Armin F{\"u}genschuh and Zhiyi Tan and Z. Tuza and Krzysztof Węsek",
year = "2018",
month = "3",
day = "1",
doi = "10.1007/s10100-017-0481-z",
language = "English",
volume = "26",
pages = "161--180",
journal = "Central European Journal of Operations Research",
issn = "1435-246X",
publisher = "Physica-Verlag",
number = "1",

}

TY - JOUR

T1 - Tight upper bounds for semi-online scheduling on two uniform machines with known optimum

AU - Dósa, G.

AU - Fügenschuh, Armin

AU - Tan, Zhiyi

AU - Tuza, Z.

AU - Węsek, Krzysztof

PY - 2018/3/1

Y1 - 2018/3/1

N2 - We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worst-case ratio of the solution given by an algorithm in comparison to the optimal offline solution. In this paper, we make a further step towards completing the answer to this question by determining the optimal competitive ratio for s between 5+24112≈1.7103 and 3≈1.7321, one of the intervals that were still open. Namely, we present and analyze a compound algorithm achieving the previously known lower bounds.

AB - We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worst-case ratio of the solution given by an algorithm in comparison to the optimal offline solution. In this paper, we make a further step towards completing the answer to this question by determining the optimal competitive ratio for s between 5+24112≈1.7103 and 3≈1.7321, one of the intervals that were still open. Namely, we present and analyze a compound algorithm achieving the previously known lower bounds.

KW - Makespan minimization

KW - Mixed-integer linear programming

KW - Scheduling

KW - Semi-online algorithm

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

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

U2 - 10.1007/s10100-017-0481-z

DO - 10.1007/s10100-017-0481-z

M3 - Article

AN - SCOPUS:85020715304

VL - 26

SP - 161

EP - 180

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

SN - 1435-246X

IS - 1

ER -