1.Institute of Computer Science,University of Osnabrück,Osnabrück,Germany;2.Institute of Applied Stochastics and Operations Research,Clausthal University of Technology,Clausthal-Zellerfeld,Germany
Abstract:
In this paper, we introduce a new extension of the bottleneck transportation problem where additionally auxiliary resources are needed to support the transports. A single commodity has to be sent from supply to demand nodes such that the total demand is satisfied and the time at which all units of the commodity have arrived at the demand nodes is minimized. We show that already the problem with a single demand node and a single auxiliary resource is NP-hard and consider some polynomially solvable special cases.
