Deadlock-free genetic scheduling algorithm for flexible manufacturing systems with key resources
Huixia Liu, Weimin Wu, Xiaofei Han, Hongyong Yang, Wenhao Ma, Chuang Wang · 2019
For flexible manufacturing systems with key resources, a deadlock-free scheduling policy is addressed to minimize the make span based on Petri net models and genetic algorithms. In the algorithm, a chromosome has corresponded to a part sequence, that is, it is obtained by encoding the operation sequences of all jobs in the systems. The encoding method can guarantee each chromosome to satisfy the operation constraint and resource constraint. By the two-step look-ahead method in the optimal deadlock control policy, the control feasibility of a chromosome is checked and the amending method is proposed. Therefore, the final chromosomes can be feasible ones, that is, they satisfy operation-, resource- and control-constraints simultaneously. Finally, the effectiveness and feasibility of the proposed algorithm are illustrated by experimental results.