GENETIC ALGORITHM BASED DISPATCHING RULES FOR FMS SCHEDULING

Abstract

In this paper, we propose a genetic search algorithm based on the timed Petri net model in order to find an optimal or near optimal dispatching rules under specific performacce measures and restrictions. The chromosomes that start with an initial marking repersent all conflict resolutions for resources assignment and resources dispatching order. The fitness associated with penalties of each trial solution is assesses by the measure of fitness function. Our experiments show that the proposed approach does represent a good alternative for dispatching strategies of FMS problems.