摘要：AbstractPetri nets are a promising tool for development of distributed scheduling approaches and integrating these developments with state-of-the-art schedule optimization algorithms. A Petri net-based solution representation of job shop scheduling problems in a local search optimization context is studied in this paper. A novel sequence repairing scheme is proposed and evaluated in the case of standard scheduling benchmark problems. The results show the applicability of the approach, and the strength of Petri net models opens a way toward solving complex and realistic scheduling problems.
