Studies on 2-cyclic robotic scheduling

We elaborate in this article on a quadratic algorithm for a particular case of the 2-cyclic robotic scheduling problem, namely the case when at most two parts go through the production line at all times; or, what is the same, when the lifetime of the part is shorter than the duration of the cycle. This study is relevant since for the general case the best known algorithms are quintic.