Information about the author Stephan Westphal will soon be added to the site.
Online interval scheduling with a bounded number of failures
We consider the problem of scheduling intervals on m identical machines where each...
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths
We consider the k ‐Canadian Traveller Problem, which asks for a shortest path...
Interval scheduling on related machines
We consider the problem of scheduling n intervals (jobs with fixed starting times) on...
Pruning in column generation for service vehicle dispatching
Column generation techniques have become a widely used technique to successfully solve...
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m 2/3 ) -approximation algorithm for scheduling related...
A note on the k-Canadian Traveller Problem
We consider the online problem k -CTP, which is the problem to guide a vehicle from...
Papers per page: