A Petri-net-based deadlock-free genetic scheduling for flexible manufacturing systems
基于Petri网的柔性制造系统无死锁遗传调度算法

A deadlock-free genetic scheduling algorithm for flexible manufacturing systems is presented to minimize makespan. This algorithm takes into account the facts that jobs of the same type have the same predetermined processing route, and the processing time is different from different job. The operation sequences of jobs and the allocation of resources are modeled logically by a Petri net. In the proposed genetic algorithm, the operation sequence of all jobs in the system is encoded as a chromosome. By using the deadlock-avoidance Petri net controller for the system, the chromosome is tested and amended so that it can be decoded into a schedule that satisfies the resource constraint and the deadlock-free constraint. Thus, all chromosomes in the algorithm are corresponding to feasible schedules. Experimental results demonstrate the effectiveness and feasibility of the proposed genetic algorithm.