Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, the paper provides a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, it is able to use standard Petri net theory. This paper will show that it can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson.
