The bottleneck transportation problem with auxiliary resources

Autor(en): Waldherr, Stefan 
Poppenborg, Jens
Knust, Sigrid 
Stichwörter: ALGORITHMS; Bottleneck transportation problem; Complexity; FIXED-CHARGE TRANSPORTATION; Operations Research & Management Science; Resources; Transportation problem
Erscheinungsdatum: 2015
Herausgeber: SPRINGER HEIDELBERG
Journal: 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
Volumen: 13
Ausgabe: 3
Startseite: 279
Seitenende: 292
Zusammenfassung: 
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.
ISSN: 16194500
DOI: 10.1007/s10288-015-0284-9

Show full item record

Page view(s)

4
Last Week
1
Last month
1
checked on Feb 22, 2024

Google ScholarTM

Check

Altmetric