Minimizing Overshipments In Bottleneck Transportation Problems

25 May 1983

journal article
research article
Published by Taylor & Francis in INFOR: Information Systems and Operational Research

Vol. 21 (2) , 121-135
https://doi.org/10.1080/03155986.1983.11731891

Abstract

Bottleneck transportation problems usually arise in connection with perishable comnjodities that have to be distributed as quickly as possible. A new approach is given that often permits the acceleration of the distribution. This reduction of the classical bottleneck time is obtained by allowing certain overshipments in the network. A primal algorithm will be given that determines completely the bottleneck time overshipment function. The technique will include capacity restrictions, and will also yield an efficient solution procedure for the classical bottleneck problem and for overshipment problems.

Keywords

This publication has 8 references indexed in Scilit:

Primal transportation and transshipment algorithms
Mathematical Methods of Operations Research, 1980
An augmenting path method for solving Linear Bottleneck Transportation problems
Computing, 1979
A Variant Of The Primal Transportation Algorithm^*
INFOR: Information Systems and Operational Research, 1978
Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
Naval Research Logistics Quarterly, 1976
The lower bounded and partial upper bounded distribution model
Naval Research Logistics Quarterly, 1973
The bottleneck transportation problem
Naval Research Logistics Quarterly, 1971
The transportation paradox
Naval Research Logistics Quarterly, 1971
The lower bounded and partial upper bounded distribution model
Naval Research Logistics Quarterly, 1971