A MATHEMATICAL MODEL FOR CYCLIC SCHEDULING WITH WORK-IN-PROGRESS MINIMIZATION

In this paper, we focus on the cyclic scheduling problem. This kind of schedule is well fitted to medium and large production demand, since it allows to avoid the scheduling of the whole tasks and to handle the combinatorial explosion of the problem by considering only a small pattern (cycle). The reduction of combinatorial complexity do not necessarily reduce the overall complexity since new constraints are introduced (scheduling of operations in a temporal window of fixed size). Thus, we propose a formal study of this problem and a linear mathematical model allowing its exact resolution.