Report in Wirtschaftsmathematik (WIMA Report)
Refine
Year of publication
- 2003 (1) (remove)
Document Type
- Preprint (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- Network flows (1) (remove)
Faculty / Organisational entity
88
In this paper we discuss an earliest arrival flow problem of a network having arc travel times and capacities that vary with time over a finite time horizon T. We also consider the possibility to wait (or park) at a node before departingon outgoing arc. This waiting is bounded by the value of maximum waiting time and the node capacity which also vary with time.