We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
SOME EQUIVALENT OBJECTIVES FOR DYNAMIC NETWORK FLOW PROBLEMS.
- Authors
Jarvis, John J.; Ratliff, H. Donald
- 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.
- Subjects
MANAGEMENT education; NETWORK analysis (Planning); BUILDING evacuation; EMERGENCY management; MATHEMATICAL models of industrial management; MATHEMATICAL models; TREE graphs; SYSTEM analysis; MATHEMATICAL optimization
- Publication
Management Science, 1982, Vol 28, Issue 1, p106
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.28.1.106