| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 714826 | IFAC Proceedings Volumes | 2012 | 6 Pages |
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 compact CPN representations of scheduling problems are proposed. It is shown how a combination of CPN representations 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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
