3 papers
cs.DS2019
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…
cs.DM2018
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…
cs.DS2017
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…