A Scheduling Algorithm Based on Petri Nets and Simulated Annealing
Rachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida and Hicham Tebbikh
DOI : 10.3844/ajassp.2007.269.273
American Journal of Applied Sciences
Volume 4, Issue 5
This study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static and dynamic behavior of the HFMS and design scheduling solutions. Hierarchical Petri nets model was regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process which was composed of many operations and tasks. The complex scheduling problem was decomposed in simple sub-problems. Scheduling algorithm was applied on each sub model in order to resolve conflicts on shared production resources.
© 2007 Rachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida and Hicham Tebbikh. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.