1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2017
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…
cs.DS2012
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…
cs.DS2011★ 1 cited
The traveling salesman problem on cubic and subcubic graphs
Sylvia Boyd, René Sitters, Suzanne van der Ster +1
We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relati…