ABSTRACT
Abstract This chapter is an introduction to cyclic scheduling. We focus on a useful generalization of precedence constraints in a cyclic context, called uniform task systems. We show how it can be used to model problems from different applications fields, and introduce the main concepts and results that have been proposed to solve cycle time minimization problems, with and without resource constraints.
