Ruben Hoeksma
YOU?
Author Swipe
View article: Stochastic scheduling with Bernoulli-type jobs through policy stratification
Stochastic scheduling with Bernoulli-type jobs through policy stratification Open
This paper addresses the problem of computing a scheduling policy that minimizes the total expected completion time of a set of $N$ jobs with stochastic processing times on $m$ parallel identical machines. When all processing times follow …
View article: Optimizing Parcel Transportation of PostNL
Optimizing Parcel Transportation of PostNL Open
We consider a multi-commodity transportation problem that arises in parcel delivery in the Netherlands. We focus on its deterministic variant and propose a mixed-integer programming model to solve it. We provide an implementation that is b…
View article: Paging with Succinct Predictions
Paging with Succinct Predictions Open
Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms -- a recent line of research that aims to ameliorate the shortcomings of classical wor…
View article: On Hop-Constrained Steiner Trees in Tree-Like Metrics
On Hop-Constrained Steiner Trees in Tree-Like Metrics Open
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint that requires the depth of the tree to be at most k. Our main result is an exact algorithm for metrics induced by graphs with bounded treewidth that…
View article: Online search for a hyperplane in high-dimensional Euclidean space
Online search for a hyperplane in high-dimensional Euclidean space Open
We consider the online search problem in which a server starting at the origin of a d-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which each…
View article: Online Search for a Hyperplane in High-Dimensional Euclidean Space
Online Search for a Hyperplane in High-Dimensional Euclidean Space Open
We consider the online search problem in which a server starting at the origin of a $d$-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which ea…
View article: Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals Open
The classic prophet inequality states that, when faced with a finite sequence of nonnegative independent random variables, a gambler who knows the distribution and is allowed to stop the sequence at any time, can obtain, in expectation, at…
View article: A better lower bound for Lower-Left Anchored Rectangle Packing
A better lower bound for Lower-Left Anchored Rectangle Packing Open
Given any set of points $S$ in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in $S$, exist, such that each of them has a point in $S$ as its lower-left corner, they are pairwise interio…
View article: Speed-Robust Scheduling -- Sand, Bricks, and Rocks
Speed-Robust Scheduling -- Sand, Bricks, and Rocks Open
The speed-robust scheduling problem is a two-stage problem where given $m$ machines, jobs must be grouped into at most $m$ bags while the processing speeds of the given $m$ machines are unknown. After the speeds are revealed, the grouped j…
View article: A PTAS for Euclidean TSP with Hyperplane Neighborhoods
A PTAS for Euclidean TSP with Hyperplane Neighborhoods Open
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclide…
View article: On Hop-Constrained Steiner Trees in Tree-Like Metrics
On Hop-Constrained Steiner Trees in Tree-Like Metrics Open
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most $k$. Our main result is an exact algorithm for metrics induced by graphs with bounded treewidth t…
View article: Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics Open
We consider the problem of computing a Steiner tree of minimum cost under a k-hop constraint which requires the depth of the tree to be at most k. Our main result is an exact algorithm for metrics induced by graphs of bounded treewidth tha…
View article: Recent developments in prophet inequalities
Recent developments in prophet inequalities Open
The classic prophet inequality states that, when faced with a finite sequence of non-negative independent random variables, a gambler who knows their distribution and is allowed to stop the sequence at any time, can obtain, in expectation,…
View article: Scheduling Self-Suspending Tasks: New and Old Results
Scheduling Self-Suspending Tasks: New and Old Results Open
In computing systems, a job may suspend itself (before it finishes its execution) when it has to wait for certain results from other (usually external) activities. For real-time systems, such self-suspension behavior has been shown to indu…
View article: On the Complexity of Anchored Rectangle Packing
On the Complexity of Anchored Rectangle Packing Open
In the Anchored Rectangle Packing (ARP) problem, we are given a set of points P in the unit square [0,1]^2 and seek a maximum-area set of axis-aligned interior-disjoint rectangles S, each of which is anchored at a point p in P. In the most…
View article: A PTAS for Euclidean TSP with Hyperplane Neighborhoods
A PTAS for Euclidean TSP with Hyperplane Neighborhoods Open
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given\na collection of geometric regions in some space. The goal is to output a tour\nof minimum length that visits at least one point in each region. Even in the\nEucl…
View article: Scheduling Self-Suspending Tasks: New and Old Results (Artifact)
Scheduling Self-Suspending Tasks: New and Old Results (Artifact) Open
In computing systems, a job may suspend itself (before it finishes its execution) when it has to wait for certain results from other (usually external) activities. For real-time systems, such self-suspension behavior has been shown to indu…
View article: A tutorial on mechanism design in scheduling
A tutorial on mechanism design in scheduling Open
in Poznań, which is the host of this event.The IWDSP 2018 workshop is the second event in the series started in 2016, focused on dynamic scheduling problems defined by parameters whose values are varying in time.Problems of this kind appea…
View article: A PTAS for Euclidean TSP with Hyperplane Neighborhoods
A PTAS for Euclidean TSP with Hyperplane Neighborhoods Open
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclide…
View article: SUPERSET: A (Super)Natural Variant of the Card Game SET
SUPERSET: A (Super)Natural Variant of the Card Game SET Open
We consider Superset, a lesser-known yet interesting variant of the famous card game Set. Here, players look for Supersets instead of Sets, that is, the symmetric difference of two Sets that intersect in exactly one card. In this paper, we…
View article: Posted Price Mechanisms for a Random Stream of Customers
Posted Price Mechanisms for a Random Stream of Customers Open
Posted price mechanisms constitute a widely used way of selling items to strategic consumers. Although subop-timal, the a ractiveness of these mechanisms comes from their simplicity and easy implementation. In this pa-per, we investigate t…
View article: A QPTAS for the General Scheduling Problem with Identical Release Dates
A QPTAS for the General Scheduling Problem with Identical Release Dates Open
The General Scheduling Problem (GSP) generalizes scheduling problems with sum of cost objectives such as weighted flow time and weighted tardiness. Given a set of jobs with processing times, release dates, and job dependent cost functions,…
View article: Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types Open
We study the design of mechanisms for a sequencing problem where the types of job-agents consist of processing times and waiting costs that are private to the jobs. In the Bayes-Nash setting, we seek to find a sequencing rule and incentive…