activity
20112023
most citedEnergy Efficient Scheduling and Routing via Randomized Rounding

42 citations · 53 across the 9 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2023

New Bounds for Time-Dependent Scheduling with Uniform Deterioration

Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik +1

Time-dependent scheduling with linear deterioration involves determining when to execute jobs whose processing times degrade as their beginning is delayed. Each job i is associated…

cs.DS2019

Approximate and Robust Bounded Job Start Scheduling for Royal Mail Delivery Offices

Dimitrios Letsios, Jeremy T. Bradley, Suraj G +2

Motivated by mail delivery scheduling problems arising in Royal Mail, we study a generalization of the fundamental makespan scheduling P||Cmax problem which we call the bounded job…

cs.DS2014

Speed-scaling with no Preemptions

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli

We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release d…

cs.DS2014★ 42 cited

Energy Efficient Scheduling and Routing via Randomized Rounding

Evripidis Bampis, Alexander Kononov, Dimitrios Letsios +2

We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We…

cs.DS2011★ 3 cited

Speed Scaling on Parallel Processors with Migration

Eric Angel, Evripidis Bampis, Fadi Kacem +1

We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the tot…