17 citations · 29 across the 9 of their papers we have counts for
11 papers
An time approximation scheme for capacitated VRP in the Euclidean plane
René Sitters
We present a quasi polynomial time approximation scheme (Q-PTAS) for the capacitated vehicle routing problem (CVRP) on points in the Euclidean plane for arbitrary capacity .…
A -approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
René Sitters, Liya Yang
We give a -approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent c…
The triangle scheduling problem
Christoph Dürr, Zdeněk Hanzálek, Christian Konrad +4
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality lev…
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…
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
René Sitters
We give a polynomial time, -approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane and on weighted trees. This improves on the known quasi-…
Split Scheduling with Uniform Setup Times
Frans Schalekamp, Rene Sitters, Suzanne van der Ster +3
We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job req…