42 citations · 56 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2
In this paper, we consider the online problem of scheduling independent jobs \emph{non-preemptively} so as to minimize the weighted flow-time on a set of unrelated machines. There…
cs.DS2018
Online Non-preemptive Scheduling on Unrelated Machines with Rejections
Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2
When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving th…