Sequence Planning for Labeled Petri Nets With Time and Resource Constraints Using Basis Markings

Sequence Planning for Labeled Petri Nets With Time and Resource Constraints Using Basis Markings

This paper addresses the scheduling problem for discrete event systems modeled by labeled Petri nets with time and resource constraints where deadlocks are inevitable. For better resource utilization and shorter processing time, a heuristic algorithm is presented for designing a suitable transition...

Full description

Bibliographic Details
Main Authors: Yejia Liu, Xunbo Li, Ahmed M. El-Sherbeeny
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Basis marking
discrete event system
labeled Petri net
resource consumption
sequence planning
Online Access:https://ieeexplore.ieee.org/document/10272588/

Internet

https://ieeexplore.ieee.org/document/10272588/

Similar Items