Given a network with a source and a destination vertices, fixed traversal times, time-dependent capacities of edges, and permissible held-over periods at the vertices. The p-period maximal dynamic flow problem is to find the maximal flow that can be transferred from the source to the destination within p periods of time. The paper presents an ulgorithm for the solution of this problem, reviews previous results for simpler cases and reports on some limited computational experience.