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.
Index Terms—Automated manufacturing systems,
multiobjective heuristic search, Pareto-optimal schedules, Petri
nets.
C. Yu and B. Huang are with the School of Computer Science and
Engineering, Nanjing University of Science and Technology, Nanjing
210094, China (Corresponding author: B. Huang; e-mail:
yuchong@njust.edu.cn; huangbo@njust.edu.cn).
J. G. Hao is with the Nanjing Les Information Technology Co. Ltd.,
Nanjing 210007, China (e-mail: hjgnj@gmail.com).
Cite: Chong Yu, Bo Huang, and Jiangen Hao, "Multiobjective Heuristic Scheduling of Automated Manufacturing Systems Based on Petri Nets," International Journal of Machine Learning and Computing vol. 11, no. 1, pp. 176-181, 2021.
Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).