Title
Reachability Tree-Based Optimization Algorithm for Cyclic Scheduling of Timed Petri Nets
Abstract
Timed Petri nets (TPNs) have been widely used for modeling discrete-event systems of diverse manufacturing and service industries. In this article, we introduce a reachability tree-based optimization algorithm to optimize cyclic schedules of TPNs. In particular, we focus on a special class of cyclic schedules that are referred to as one-cyclic schedules, i.e., the algorithm efficiently finds the o...
Year
DOI
Venue
2021
10.1109/TASE.2020.3009984
IEEE Transactions on Automation Science and Engineering
Keywords
DocType
Volume
Schedules,Job shop scheduling,Petri nets,Optimal scheduling,Processor scheduling,Tools,Computational modeling
Journal
18
Issue
ISSN
Citations 
3
1545-5955
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Chulhan Kim100.68
Tae-Sun Yu2113.85
Tae-Eog Lee362.10