We consider the problem of routing customers to one of two parallel queues where inter-arrival times and service times are deterministic. We provide an explicit formula for the average waiting time of the customers sent to one of the queues when the routing policy is an upper mechanical word. This formula is based on a special continued fraction decomposition of the service time in the queue. Using this formula we provide an algorithm computing the optimal routing policy for two queues. In general, this policy is an upper mechanical word with a rational ratio, and hence is periodic. || Dans cet article nous {étudions le routage de clients dans deux files d'attente déterministes parallèles, les temps d'interarrivées étant supposés déterministes. Nous donnons une formule explicite de la moyenne du temps d'attente des clients introduits da