Continuous Approach of Scheduling Problems Based on Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

Continuous Approach of Scheduling Problems Based on Petri Nets

Nathalie Sauer

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2822.pdf (800.01 Ko) Télécharger le fichier

Dates and versions

inria-00073870 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073870 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More