In this paper, we consider deterministic timed continuous Petri nets where conflicts at places are solved by assigning stationary routing parameters. We show how to compute the stationary firing rate at all transitions as well as how to determine the optimal routing parameters to maximize the firing rates. Finally, we discuss the relations with discrete Petri nets.