2016
EMSS 2016 Proceeding
Simulation-optimization of schedules with sequence dependent setup times based on Petri net models
Authors: G. Mu?i?
Abstract
The paper deals with simulation-optimization of schedules with sequence dependent setup times. Such scheduling problems are commonly found in industry where machine setups or cleaning procedures are required among different jobs. The problems can be effectively modelled by simple Coloured Petri nets (CPNs). CPN modelling is combined with new type of simulation based on predefined transition set sequence conflict resolution strategy and standard permutation representation of job schedules. This enables generation of neighbouring solutions that are always feasible and standard local search optimization algorithms can be effectively applied to derived models. Modelling approach and neighbourhood construction procedure are explained in detail. Results of tests on sample scheduling problems by simulated annealing and genetic algorithms are provided.
I3M Scientific Sponsors
I3M Industrial Sponsors
I3M Media Sponsors
