  In the paper, the new approach to the scheduling problem are described. The
approach deals with the problem of planning the cyclic production and proposes
to consider such scheduling problem as the cyclic job-shop problem of the order
k, where k is the number of reiterations. It was found out that planning of
only one iteration of the loop is less effective than planning of the entire
cycle. To the experimental research, a number of test instances of the job-shop
scheduling problem by Operation Research Library were used. The Simulated
Annealing was applied to solve the instances. The experiments proved that the
approach proposed allows increasing the efficiency of cyclic scheduling
significantly.
