摘要：AbstractPetri nets (PN) are a versatile modelling tool that can also be used to represent scheduling problems. In this paper, a PN-based representation of schedules is investigated in the context of optimization by genetic algorithms (GA). A new sequence repair scheme is proposed, integrated into the GA optimizer, and applied to standard benchmark instances of the flexible job shop scheduling problem. The results are compared with other state-of-the-art approaches. The main contribution of the paper is a step towards bridging the gap between PN modelling and advanced scheduling algorithms. The results motivate further research on the use of Petri net models in solving complex scheduling problems.
