Time minimizing flows in directed networks

Robert G. Hinkle and John J. Jarvis

Naval Research Logistics Quarterly, 1982, vol. 29, issue 2, 247-256

Abstract: An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time‐minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time‐minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800290206

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:29:y:1982:i:2:p:247-256

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().