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.
Type de document :
Rapport
[Research Report] RR-2822, INRIA. 1996, pp.16
Liste complète des métadonnées

https://hal.inria.fr/inria-00073870
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:57:12
Dernière modification le : samedi 17 septembre 2016 - 01:06:51
Document(s) archivé(s) le : jeudi 24 mars 2011 - 13:10:02

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

113

Téléchargements de fichiers

72