Abstract | ||
---|---|---|
Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model systems with bulk services and arrivals. We consider two problems of practical importance for this class of nets. The marking optimization problem consists in finding an initial marking to minimize the weighted sum of tokens in p... |
Year | DOI | Venue |
---|---|---|
2017 | 10.1109/TASE.2015.2490538 | IEEE Transactions on Automation Science and Engineering |
Keywords | DocType | Volume |
Optimization,Heuristic algorithms,Petri nets,Clocks,Throughput,Schedules,Delays | Conference | 14 |
Issue | ISSN | Citations |
2 | 1545-5955 | 3 |
PageRank | References | Authors |
0.37 | 13 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhou He | 1 | 15 | 4.62 |
Zhi Wu Li | 2 | 470 | 38.43 |
Alessandro Giua | 3 | 1836 | 199.57 |