Schedule Optimization based on Coloured Petri Nets and Local Search


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 compact CPN representations of scheduling problems are proposed. It is shown how a combination of CPN representations with predefined transition sequence conflict… (More)


5 Figures and Tables

Slides referencing similar topics