Westphal Stephan

Stephan Westphal

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