Petri net based scheduling

W. M. P. van der Aalst
1996 OR spectrum  
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
more » ... net based analysis of the notorious 10 × 10 problem due to Fisher & Thompson (1963) .
doi:10.1007/bf01540160 fatcat:adhdub4mzbaalhpqqslbqqgnie