3 citations · 3 across the 12 of their papers we have counts for
3 papers · 1 filter
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
Franziska Eberle, Nicole Megow, Kevin Schewior
We consider a fundamental online scheduling problem in which jobs with processing times and deadlines arrive online over time at their release dates. The task is to determine a fea…
Improved Bounds for Open Online Dial-a-Ride on the Line
Alexander Birx, Yann Disser, Kevin Schewior
We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a…
Online Multistage Subset Maximization Problems
Evripidis Bampis, Bruno Escoffier, Kevin Schewior +1
Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as \emph{subset maximization problems}: One is given a ground set $N=\{1,\do…