## Semi-Online Scheduling on Two Uniform Machines with Known Optimum, Part II: Tight Upper Bounds

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 … Read more