HGA-PN: A New Algorithm for Scheduling FMS Using Combinational Genetic Algorithm and Timed Petri Net

In flexible manufacturing systems (FMS), each job is formed of a set of operations that should be executed consecutive. Determining the sequence of operations and assigning proper machine to each operation are two important problems in scheduling FMS´s. This is an NP-hard problem. Recently using heuristic methods, numerous algorithms are presented for solving this problem. In this paper for scheduling of flexible manufacturing systems, a new algorithm called hybrid genetic algorithm-Petri net (HGA-PN) is presented using timed Petri net and combinational genetic algorithm. In our purposed algorithm, first the flexible manufacturing system is modeled by using timed Petri net, and then an appropriate scheduling is manufactured using combinational genetic algorithm. The experimental results illustrates that our proposed algorithm has higher efficiency over other existing algorithms.