Petri net based scheduling
Wil M. P. van der Aalst · 1995
. Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lowerbounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10 \\Theta 10 problem due to Fisher & Thompson (1963). Keywords: Scheduling, Timed Petri nets, Analysis of Petri nets. 1 Introduction During the last two decades, much research has been done simultaneously on Petri nets and scheduling problems. The results achieved in both research areas have been applied to production systems, logistic systems and computer systems. Although scheduling techniques and Petri nets focus on the same application domains, ther...