Logistics, queueing networks and model reduction
Abstract:
In modern logistics applications large scale networks are increasingly important, for instance due to the emergence of transnational supply chains and small lot size. Analysis or simulation of such networks becomes prohibitive. In this talks we will discuss techniques of model reduction that help in preserving important structural components of a given logistics network while reducing the complexity to arrive at models that are amenable to analysis. The techniques rely on results from queueing theory, which provides the reference framework for the modelling of logistics networks and ideas from graph theory related to ranking schemes.
Biography:
Fabian Wirth received his Ph.D. in mathematics from the Institute of Dynamical Systems at the University of Bremen in 1995. He has since held positions in Bremen, at the Centre Automatique et Systèmes of Ecole des Mines Fontainebleau and at the Hamilton Institute at NUI Maynooth, Ireland. He is currently professor for Dynamical Systems at the Institute for Mathematics of the University of Würzburg in Germany. His current interests include stability theory, switched systems and large scale systems with applications in communications and logistics.