A faster polynomial algorithm for 2-cyclic robotic scheduling

This paper addresses the 2-cyclic identical part scheduling in a no-wait robotic flowshop where exactly two parts enter and two parts leave the production line during each cycle. This problem was previously proved to be polynomially solvable in O(N8log N) time, where N is the number of tanks in the production line. This paper proposes an improved algorithm with reduced complexity O(N5log N).