Deadlock-free scheduling strategy for automated production cell

Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedule in a Manufacturing System with very limited buffer is presented. This algorithm is based on the effective Genetic Algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using an example.