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

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+214,3+738]≈[1.3956,1.443] and $$[\frac{5}{3},\frac{4+\sqrt{133}}{9}]\approx [\frac{5}{3},1.7258]$$[53,4+1339]≈[53,1.7258], except a very narrow interval.