Generation of Feasible Petri Net Based Scheduling Problem Solutions

Abstract

The contribution deals with local search based optimization of schedules that are modelled by Petri nets (PNs). PN modelling of scheduling problems in manufacturing domain is addressed and a generalization of neighbour solution generation is proposed. Such a solution generator can be used to optimize schedules by standard local search optimization algorithms. Neighbourhood construction procedures are described with the emphasis on solutions feasibility.