Skip to main content
SpringerLink
Log in

The bottleneck transportation problem with auxiliary resources

  • Research paper
  • Published:
4OR Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Du J, Leung JYT, Wong CS (1992) Minimizing the number of late jobs with release time constraint. J Comb Math Comb Comput 11:97–107

    Google Scholar 

  • Garfinkel RS, Rao MR (1971) The bottleneck transportation problem. Nav Res Logist Q 18(4):465–472

    Article  Google Scholar 

  • Hammer PL (1969) Time minimizing transportation problems. Nav Res Logist Q 16:345–357

    Article  Google Scholar 

  • Herer YT, Rosenblatt MJ, Hefter I (1996) Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transp Sci 30(4):276–290

    Article  Google Scholar 

  • Klose A (2008) Algorithms for solving the single-sink fixed-charge transportation problem. Comput Op Res 35(6):2079–2092

    Article  Google Scholar 

  • Krüger D (2009) Multi-project scheduling with resource transfers. PhD thesis, Friedrich-Schiller-Universität, Jena

  • Poppenborg J (2014) Modeling and optimizing the evacuation of hospitals based on the RCPSP with resource transfers. PhD thesis, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

Download references

Acknowledgments

We gratefully acknowledge the help of anonymous referees who gave several constructive comments to an earlier version of this paper.

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Osnabrück, Osnabrück, Germany

    Stefan Waldherr & Sigrid Knust

  2. Institute of Applied Stochastics and Operations Research, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Jens Poppenborg

Authors
  1. Stefan Waldherr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Poppenborg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sigrid Knust
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Waldherr.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Waldherr, S., Poppenborg, J. & Knust, S. The bottleneck transportation problem with auxiliary resources. 4OR-Q J Oper Res 13, 279–292 (2015). https://doi.org/10.1007/s10288-015-0284-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-015-0284-9

Keywords

Mathematics Subject Classification

Search

Navigation