论文部分内容阅读
An efficient algorithm for finding an optimal deadlock-free schedule in a manufacturingsystem 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 assuringdeadlock-free. In order to make the scheduling strategy generated by GA meet the required constraintof deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMSdeadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using anexample.
An 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 assuringdeadlock -free. In order to make the scheduling strategy generated by GA meet the required constraintof deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMSdeadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using anexample.