The bottleneck transportation problem with auxiliary resources

DC FieldValueLanguage
dc.contributor.authorWaldherr, Stefan
dc.contributor.authorPoppenborg, Jens
dc.contributor.authorKnust, Sigrid
dc.date.accessioned2021-12-23T16:11:44Z-
dc.date.available2021-12-23T16:11:44Z-
dc.date.issued2015
dc.identifier.issn16194500
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/9862-
dc.description.abstractIn 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.
dc.language.isoen
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartof4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
dc.subjectALGORITHMS
dc.subjectBottleneck transportation problem
dc.subjectComplexity
dc.subjectFIXED-CHARGE TRANSPORTATION
dc.subjectOperations Research & Management Science
dc.subjectResources
dc.subjectTransportation problem
dc.titleThe bottleneck transportation problem with auxiliary resources
dc.typejournal article
dc.identifier.doi10.1007/s10288-015-0284-9
dc.identifier.isiISI:000360080700003
dc.description.volume13
dc.description.issue3
dc.description.startpage279
dc.description.endpage292
dc.identifier.eissn16142411
dc.publisher.placeTIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY
dcterms.isPartOf.abbreviation4OR-Q. J. Oper. Res.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidWaSt588-
crisitem.author.netidKnSi808-
Show simple item record

Page view(s)

4
Last Week
0
Last month
0
checked on Apr 14, 2024

Google ScholarTM

Check

Altmetric