Dwibedy, Debasis; Mohanty, Rakesh - 2023
context of online scheduling in identical machine frameworks. We introduce a $k$-lookahead model and design improved … competitive semi-online algorithms. For a $2$-identical machine setting, we prove a lower bound of $\frac{4}{3}$ and design an … optimal algorithm with a matching upper bound of $\frac{4}{3}$ on the competitive ratio. For a $3$-identical machine setting …