Abstract
In practice, automated manufacturing systems usually have multiple, incommensurate, and conflicting objectives to achieve. To deal with them, this paper proposes an extend Petri nets for the multiobjective scheduling of AMSs. In addition, a multiobjective heuristic A* search within reachability graphs of extended Petri nets is also proposed to schedule these nets. The method can obtain all Pareto-optimal schedules for the underlying systems if admissible heuristic functions are used. Finally, the effectiveness of the method is illustrated by some experimental systems.
Highlights
Automated Manufacturing Systems (AMSs) are a kind of computer-controlled systems that consist of limited resources and can handle different types of parts
We developed some approaches to improve the search process, such as a hybrid heuristic A∗ search [12], dynamic weighted A∗ search [13], and more informed heuristics [14]
We propose a multiobjective A∗ search algorithm within reachability graphs of Petri nets to obtain Pareto-optimal schedules for AMSs
Summary
Automated Manufacturing Systems (AMSs) are a kind of computer-controlled systems that consist of limited resources and can handle different types of parts. In order to execute the automated manufacturing system effectively and make full use of system resources, it is necessary to coordinate and control the use of shared resources. This scheduling problem is NP-hard, because the computational time increases exponentially with system size [1]. Petri nets (PNs) are a graphical and mathematical modeling tool that is suitable for modeling distributed, concurrent, parallel, asynchronous in discrete event systems. They have become a popular tool to model and analyze AMSs [2]-[5].
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Machine Learning and Computing
Disclaimer: 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.
