Abstract
In this paper, we show how to model with a timed Petri net, tasks, resources and constraints of a scheduling problem.
This model has the significant advantage, over the classical one, to represent with a single formalism, succession constraints as well as resource ones.
This model allows us to extend the scheduling field and to propose solutions to new problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
ABDEL-WAHAB, H.M., KAMEDA, T. "Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints" Operations Res. 26, 141–158, 1978.
BERTHOMIEU, B., MENASCHE, M. "A state enumeration approach for analyzing time Petri nets" 3rd european workshop on application and theory of Petri nets, VARENNA, sept. 1982.
BRAMS, G.W. "Réseaux de Petri: théorie et pratique" Tome 1: Théorie et Analyse (Masson 1981).
BRAUER, W. (Editor) "Advanced course on general net theory of processes and systems, HAMBURG, october 1979 Lecture notes in Computer Science, n°84, Springer Verlag, 1980.
CARLIER, J., CHRETIENNE, Ph. "Un domaine très ouvert: les problèmes d'ordonnancement" RAIRO, recherche opérationnelle, n°3, août 1982.
CARLIER, J., RINNOOY-KAN, A.H.G. "Financing and scheduling" Operations Research Letters, 1, 1982.
CARLIER, J. "Le problème de l'ordonnancement des paiements de dettes" RAIRO, série verte, n°1, février 1984.
CHRETIENNE, Ph. "Thèse d'Etat: Les réseaux de Petri temporisés" Université Paris VI, juin 1983.
CHRETIENNE, Ph. "Some results on the control of timed Petri nets" 2nd european workshop on theory and application of Petri-nets. BAD-HONNEF, septembre 1981.
CHRETIENNE, Ph. "Timed event graphs: behaviour analysis and a study of the reachability relation" C.I.S.S. 83, John Hopkins University, BALTIMORE, mars 1983.
COFFMAN, E.G. "Computer and job-shop scheduling theory" John Wiley and Sons, 1976.
GAREY, M.R., JOHNSON, D.S. "Computers and intractability" W.H. Freeman and Company, 1978.
GRAHAM, R.L., LAWLER, E.L., LENSTRA, J.K., RINNOOY KAN, A.H.G. "Optimization and approximation in deterministic sequencing and scheduling: a survey" Ann Discrete Math., 1979.
HOLT, A., COMMONER, F., EVEN, S., PNUELI, A. "Marked directed graphs" Journal of computer and system sciences, vol.5, n°5, oct. 1971.
MERLIN, P. "A study of the recoverability of computer systems" Ph. D. thesis, University of California, IRVINE Computer Science.
PETERSON, J. "Petri-net theory and the modelling of systems" Prentice-Hall, 1981.
RAMCHANDANI, C. "Analysis of asynchronous concurrent systems by timed Petri nets" Ph. D. thesis, M.I.T., CAMBRIDGE, Mass. Projet MAC. MAC-TRI20, Feb. 1974.
ROY, B. "Algèbre moderne et théorie des graphes" Tome 2, Dunod, 1970.
SIFAKIS, J. "Le contrôle des systèmes asynchrones: concepts, priorités, analyse statique" Thèse d'Etat, Université scientifique et médicale de Grenoble, juin 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlier, J., Chretienne, P., Girault, C. (1985). Modelling scheduling problems with timed petri nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-15204-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15204-0
Online ISBN: 978-3-540-39320-7
eBook Packages: Springer Book Archive