A PN reachability analysis branching scheme for the scheduling of FMS

摘要

A branching scheme for the solution of scheduling problem based on reachability analyssi fo timed Petri net (PN) models of Flexible Manufacturing Systems (FMS) is described in this paper. The method reduces search by avoiding the generation of paths that do not represent an advantae with respect to already generated candidates. Experimental analysis shows that interesting results are obtained when applied to Branch and Bound, Best first A, and incomplete search methodologies such as Beam Search.