Andreas Drexl

TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.

TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.

TL;DR: It is shown that hard instances, being far more smaller in size than presumed in the literature, may not be solved to optimality even within a large amount of computation time.

TL;DR: This contribution summarizes recent work in the field of lot sizing and scheduling and explains differences of formal models and provides some first readings recommendations on capacitated, dynamic, and deterministic cases.

TL;DR: In this article, the authors present a survey of recent work in the field of lot sizing and scheduling, focusing on capacitated, dynamic, and deterministic cases, and provide some first readings recommendations.