157 citations · 211 across the 8 of their papers we have counts for
8 papers · 1 filter
Total Completion Time Scheduling Under Scenarios
Thomas Bosman, Martijn van Ee, Ekin Ergen +4
Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study inte…
A Universal Error Measure for Input Predictions Applied to Online Graph Problems
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela +3
We introduce a novel measure for quantifying the error in input predictions. The error is based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a ge…
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
Thomas Bosman, Martijn van Ee, Yang Jiao +3
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the lit…
Scheduling over Scenarios on Two Machines
Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp +4
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scena…
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller +1
A model has been proposed in [Baruah et al., in Proceedings of the IEEE Real-Time Systems Symposium 2012] for representing recurrent precedence-constrained tasks to be executed on…
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of mult…