Abstract
Abstract The contribution deals with simulation-optimization of schedules that are modelled by Coloured Petri nets (CPNs). CPN modelling of standard classes of scheduling problems is addressed and compact CPN representations of scheduling problems are derived. A combination of CPN representations with predefined transition sequence conflict resolution strategy is proposed to optimize schedules by standard local search optimization algorithms. The approach is supplemented by exploration of usability of various standard objective functions within the CPN scheduling framework.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
