The Hydraulic Infinite Linear Actuator (HILA) is an actuator with a through-roddesign, where the piston is able to grip or release the rod during operation. If multiplepistons, connected in series, take turn in gripping, moving, and releasing the rod,a continuous linear motion without the stroke limitations of conventional hydraulicactuators is achieved. This allows the actuator to extend or retract indefinitely whilemaintaining force continuity. The HILA system can be extended so that each pistonis able to grip or release multiple rods, called HILA Multi-Rod (HILA MR). In thisway, a few hydraulic pistons are able to control the motion of several rods. In orderto determine which rod should be moved by which piston and when, a scheduling algorithmis required. This paper investigates two scheduling algorithms: time-domainmultiplexing and round-robin scheduling. The round-robin algorithm is extended withan early-return feature and greedy job selection. All algorithms are evaluated on a simulationmodel of a HILA with three rods and one or two pistons running a referencecycle. The simulation results show that greedy job selection outperforms the otheralgorithms, both with one and two servos. As a final test, the scheduler was extendedwith the ability to give priority to one of the rods. The results show that the rod withpriority performs very well and that the priority feature is fairly easy to implement.