In: European Journal of Operational Research, Vol. 106, No. 1, pages 45-56. 1998.
Abstract: Scheduling a manufacturing system is usually an NP-hard problem. This means that only heuristic algorithms can be used to provide near-optimal schedules. In this paper, we show that a manufacturing system can be modeled using a particular type of Petri nets, called Controllable-Output nets, or CO nets for short. These Petri net models are then used to introduce a two-stage scheduling algorithm for problems in which the product hows can be considered as piecewise constant. The first stage consists of distributing the workload among the resources, The second stage derives a schedule from the resource workload. The deterministic case is considered. Numerical results are proposed.
Keywords: Petri nets, flexible manufacturing systems, marking optimization, performance evaluation.