5 citations · 7 across the 3 of their papers we have counts for
5 papers
Total Completion Time Scheduling Under Scenarios
Thomas Bosman, Martijn van Ee, Ekin Ergen +4
Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study inte…
Improved Approximation Algorithms for Inventory Problems
Thomas Bosman, Neil Olver
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we ar…
Parallel Machine Scheduling with a Single Resource per Job
T. Janssen, C. Swennenhuis, A. Bitar +5
We study the problem of scheduling jobs on parallel machines minimizing the total completion time, with each job using exactly one resource. First, we derive fundamental properties…
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
Thomas Bosman, Martijn van Ee, Yang Jiao +3
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the lit…
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Thomas Bosman
Fixed parameter tractable algorithms for bounded treewidth are known to exist for a wide class of graph optimization problems. While most research in this area has been focused on…