2011
EMSS 2011 Proceeding
Efficient exploration of Coloured Petri net based scheduling problem solutions
Authors: Gasper Music
Abstract
The paper deals with simulation-optimization of schedules that are modelled by simple Coloured Petri nets (CPNs). CPN modelling is combined by predefined transition sequence conflict resolution strategy to enable generation of neighbouring solutions that are always feasible. This way standard local search optimization algorithms can be effectively applied to CPN models. Modelling approach and neighbourhood construction procedure are explained in detail. Some preliminary results of tests on standard job shop benchmark problems are provided.
I3M Scientific Sponsors
I3M Industrial Sponsors
I3M Media Sponsors
