Article is devoted to solving the problem of finding an optimal schedule for robotic line. The novelty in this case is to replace the traditionally considered the straight route to the route of the robot with loops, which allows in many cases significantly reduce the duration of the production cycle. Found a solution arises in this auxiliary problem - the problem of marking numbers consisting in minimizing a function defined on combinations. This particular task scheduling theory, which is yet unique, highly specialized, can be used, and no doubt in other situations. The solution to this problem, as well as the construction of the optimal time schedules robotic lines illustrated with specific input data.