TWO APPROACHES TO THE CYCLIC SCHEDULING WITH ASSEMBLY

This paper concerns the domain of Flexible Manufacturing Systems (FMS) and focuses on the scheduling problems encountered in these systems. We have chosen the cyclic behaviour to study this problem, to reduce its complexity. This cyclic scheduling problem, whose complexity is NP-hard in the general case, aims at optimize the cycle time (CT) with a minimal WIP(Work In Process). In this context, We present two resolution approaches. In the first step, a genetic approach is proposed to find a schedule which can reach the optimal production rate while minimizing the WIP. In the second step, after a Petri net model of the cyclic scheduling problem has been given, we describe a formal approach of the cyclic scheduling problem based on dioid algebra. Finally we conclude with a comparison of the two approaches.