Modelling scheduling problems with timed Petri nets. (English) Zbl 0562.68050

Advances in Petri nets 1984, Lect. Notes Comput. Sci. 188, 62-82 (1985).
Summary: [For the entire collection see Zbl 0556.00014.]
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.


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems


Zbl 0556.00014