On accurate solution tо the problem of optimal scheduling of a cyclic process

The paper is concerned with scheduling a line served by one operator. With fixed job durations the number of possible service sequences is shown to be low. Algorithms are suggested for finding the minimal cycle durations which sequentially analyze the operators rounds. Examples of computer experiments are given.