In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the stationary firing rate for all transitions via linear programming, so as to determine the optimal routing parameters that maximize-user-defined linear functions of the firing rates. Finally, we discuss the relations with discrete Petri nets. (C) 2004 Elsevier Ltd. All rights reserved.