Optimal scheduling of flexible manufacturing systems based on timed Petri nets and cost function
LI Xin
LI Liang
HE Zhou
Abstract：To solve the problem of scheduling for the minimum completion time of tasks in a flexible manufacturing system,this paper proposes a scheduling algorithm based on timed Petri nets(TdPN)and cost function.Firstly,by analyzing the existing TdPN-based scheduling algorithms,we introduce a novel cost function taking into account the transition firing vectors from the current marking and subsequent markings to the target one.Then,through traversing the cost functions of markings in the partial reachable graph,the firing of next transition is selected.Meanwhile,the employment of backtracking method prevents deadlock markings and those markings that do not meet the system specifications,thereby obtaining logical transition sequences of the TdPN system.By transforming the logical transition sequences into timed ones,the minimum time transition sequences are computed,and then the scheduling scheme for the minimum completion time of the system can be obtained.Finally,the feasibility and effectiveness of the approach presented in this paper are validated through practical instances.
Keywords：discrete event systemsschedulingPetri netsreachability graph
Publication Date：2026-02-28
Online Publishing Date：2026-04-08(First online date of this platform, not the publication date of the document)
Pages：10( 415-424 )