For the most recent entries see the Petri Nets Newsletter.

Benchmarking an algorithm for Petri net scheduling.

Liljenvall, T.

In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'2000), 8-11 October 2000, Nashville, TN, Vol. 4, pages 3027-3032. 2000.

Abstract: This paper evaluates a Petri net algorithm for scheduling of production systems. The examples presented are taken from the literature and could describe flexible manufacturing systems (FMSs) 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 (PNs) is the powerful modeling capacity. The paper examines different problem types and discusses the disadvantages and advantages of the PN algorithm.

Keywords: Petri nets, benchmarking, production systems, scheduling.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography