4 citations · 4 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…
Total stretch minimization on single and identical parallel machines
Abhinav Srivastav, Denis Trystram
We consider the classical problem of scheduling jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job b…