42 citations · 56 across the 9 of their papers we have counts for
12 papers
Robust Non-Clairvoyant Scheduling with Classification Models
Anthony Dugois, Vincent Fagnon, Giorgio Lucarelli
We study the classical single-machine scheduling problem of minimizing the sum of completion times of jobs in a non-clairvoyant setting, where the processing time of each job remai…
Scheduling on Hybrid Platforms: Improved Approximability Window
Vincent Fagnon, Imed Kacem, Giorgio Lucarelli +1
Modern platforms are using accelerators in conjunction with standard processing units in order to reduce the running time of specific operations, such as matrix operations, and imp…
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…
Generic algorithms for scheduling applications on heterogeneous multi-core platforms
Marcos Amaris, Giorgio Lucarelli, Clément Mommessin +1
We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to mos…
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
Spyros Angelopoulos, Giorgio Lucarelli, Nguyen Kim Thang
We study online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. In particular, we pro…