HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Continuous Approach of Scheduling Problems Based on Petri Nets

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 modelled using a particular type of Petri net, called Controllable-Output nets, or CO nets for short. These Petri net models are then used to introduce a two-stage scheduling algorithm for large horizon problems. 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 result are proposed.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:57:12 PM
Last modification on : Friday, February 4, 2022 - 3:17:43 AM
Long-term archiving on: : Thursday, March 24, 2011 - 1:10:02 PM


  • HAL Id : inria-00073870, version 1



Jean-Marie Proth, Nathalie Sauer. Continuous Approach of Scheduling Problems Based on Petri Nets. [Research Report] RR-2822, INRIA. 1996, pp.16. ⟨inria-00073870⟩



Record views


Files downloads