Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073870
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:57:12 PM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Thursday, March 24, 2011 - 1:10:02 PM

Identifiers

  • HAL Id : inria-00073870, version 1

Collections

Citation

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

Share

Metrics

Record views

157

Files downloads

206