Tight lower 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: Brandenburgische Technische Universität Cottbus-Senftenberg
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, 2019, vol. 27, issue 4, No 10, 1107-1130

Abstract: Abstract This problem is about scheduling a number of jobs on two uniform machines with given speeds 1 and $$s\ge 1$$ s ≥ 1 , so that the overall finishing time, i.e., the makespan, is earliest possible. We consider a semi-online variant (introduced for equal speeds) by Azar and Regev, where the jobs are arriving one after the other, while the scheduling algorithm knows the optimum value of the corresponding offline problem. One can ask how close any possible algorithm could get to the optimum value, that is, to give a lower bound on the competitive ratio: the supremum over ratios between the value of the solution given by the algorithm and the optimal offline solution. We contribute to this question by constructing tight lower bounds for all values of s in the intervals $$[\frac{1+\sqrt{21}}{4},\frac{3+\sqrt{73}}{8}]\approx [1.3956,1.443]$$ [ 1 + 21 4 , 3 + 73 8 ] ≈ [ 1.3956 , 1.443 ] and $$[\frac{5}{3},\frac{4+\sqrt{133}}{9}]\approx [\frac{5}{3},1.7258]$$ [ 5 3 , 4 + 133 9 ] ≈ [ 5 3 , 1.7258 ] , except a very narrow interval.

Keywords: Semi-online scheduling; Makespan minimization; Machine scheduling; Lower bounds (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-018-0536-9 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:27:y:2019:i:4:d:10.1007_s10100-018-0536-9

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

DOI: 10.1007/s10100-018-0536-9

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 ().