Abstract
A branching scheme for the solution of scheduling problem based on reachability analysis of 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 advantage 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
