Online scheduling paper to appear in Algorithmica

Rob van Stee's paper Online scheduling of jobs with fixed start times on related machines, coauthored with Leah Epstein, Łukasz Jeż and Jiří Sgall, was accepted to Algorithmica. It considers scheduling of jobs that must be started immediately when they are released, and gives constant competitive algorithms for several important classes of jobs, as well as a linear lower bound for another class.

Filed under:

Share this page: