Benchmarking an algorithm for Petri net scheduling

This paper evaluates a Petri net algorithm for scheduling production systems. The examples presented are taken from the literature and could describe flexible manufacturing systems as well as multi-purpose batch plants. Production systems include a large variety of constraints that make the scheduling task difficult. The main reason for choosing Petri nets is the powerful modeling capacity. Different problem types are examined and the disadvantages and advantages with of a Petri net algorithm are discussed