Note---Some Equivalent Objectives for Dynamic Network Flow Problems

John J. Jarvis and H. Donald Ratliff
Additional contact information
John J. Jarvis: Georgia Institute of Technology
H. Donald Ratliff: Georgia Institute of Technology

Management Science, 1982, vol. 28, issue 1, 106-109

Abstract: Many important problems can be modeled as dynamic (time-expanded) network flow problems. For example, in building evacuation we might use twenty nodes to represent a room at 3 minute intervals over an hour, and use arcs to indicate the feasible passages, over time, among the various rooms. The purpose of this note is to demonstrate that it is possible to satisfy at least three important objectives simultaneously in a maximal dynamic network flow problem. These are (1) construction of an earliest arrival schedule (i.e., a solution which maximizes flow in the first p periods, for every p), (2) minimization of the period at which the last unit of flow arrives at the sink, and (3) minimization of the average time for all flow to arrive at the sink.

Keywords: network models: theory; dynamic flows (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.1.106 (application/pdf)

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:inm:ormnsc:v:28:y:1982:i:1:p:106-109

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().