*Result*: OPTIMAL CYCLIC SCHEDULING ON PARALLEL PROCESSORS WITH SPECIAL PRECEDENCE CONSTRAINS.

*We consider the multiprocessors scheduling problem, where a set of jobs V is performed on <italic>m</italic> identical parallel processors and it is to be repeated an infinitely number of times. Precedence constraints between jobs are represented by a uniform graph <italic>G</italic>. The goal is to generate a periodic schedule, which is a schedule of one iteration repeated within a fixed time interval called the period (cycle). Cyclic scheduling is aimed to find a periodic schedule with the minimum period. Precedence constraints between jobs are represented by a uniform graph <italic>G</italic>. We propose cyclic scheduling algorithms for four problems with parallel processors. Bibliography: 18 titles. [ABSTRACT FROM AUTHOR]*