A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model

Online scheduling in identical machines with makespan minimization has been a well studied research problem in the literature. In online scheduling, the scheduler receives a list of jobs one by one and assigns each incoming job on the fly irrevocably to one of the machines before the arrival of the... Show more