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

György Dósa (), Armin Fügenschuh (), Zhiyi Tan (), Zsolt Tuza () and Krzysztof Węsek ()
Additional contact information
György Dósa: University of Pannonia
Armin Fügenschuh: Helmut Schmidt University/University of the Federal Armed Forces Hamburg
Zhiyi Tan: Zhejiang University
Zsolt Tuza: University of Pannonia
Krzysztof Węsek: Helmut Schmidt University/University of the Federal Armed Forces Hamburg

Central European Journal of Operations Research, 2018, vol. 26, issue 1, No 7, 180 pages

Abstract: 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 $$\frac{5 + \sqrt{241}}{12} \approx 1.7103$$ 5 + 241 12 ≈ 1.7103 and $$\sqrt{3} \approx 1.7321$$ 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: Scheduling; Semi-online algorithm; Makespan minimization; Mixed-integer linear programming (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-017-0481-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:26:y:2018:i:1:d:10.1007_s10100-017-0481-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-017-0481-z

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().