Online capacity planning of repairs

In this thesis we describe our research into a capacity planning problem that occurs in practice at a big group of car dealers, the Rüttchen group. A considerable part is about the construction of a model for this problem, showing and justifying the assumptions we make. Then it is shown that this model can be written as a Linear Program. We end by investigating related models, and show how we can solve them as either maximum flow problems, or with the help of a self-constructed algorithm based on finding augmenting paths with possibly additional cycles.