Hybrid FMS Scheduling System Based on Petri Nets and advanced Meta Heuristics
Hicham Tebbikh · 2005
This paper aims at presenting a hybrid FMS short-term scheduling problem. Scheduling problem, we are to study in this paper, is first introduced, and than a survey of the HFMS scheduling litterature is presented. Based on the art state of general scheduling algorithms, we present the Meta-heuristics; we have decided to apply for a given example of HFMS. That is the study of three advanced meta hauristics, Taboo searchTS, Genetic algorithms GA and simulated annealing SA.The HFMS model based on hierarchical Petri nets, helps to represent static and dynamic behaviour of the HFMS. This model is also used to design scheduling solutions. Hierarchical Petri nets model represents the whole process, and can be regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process that is composed of many operations and tasks (manufacturing, transport, handling). TS, GA and SA are applied on each sub-model to make ressourses allocation and to resolve conflicts on shared production ressourses. A comparison between the three Meta-heuristics is made in simulation phasis to choose the best one to use in different kinds of HFMS.