Abstract

The contribution deals with simulation-optimization of schedules that are modelled by simple Coloured Petri Nets (CPNs). CPN modelling of standard classes of scheduling problems is addressed and com-pact CPN representations of scheduling problems are proposed. It is shown how a combination of CPN repre-sentations with predefined transition sequence conflict resolution strategy can be used to optimize schedules by standard local search optimization algorithms. Possible neighbourhood construction procedures for various problem classes are proposed with the emphasis on solutions feasibility.