Title
Cycle time optimization of deterministic timed weighted marked graphs
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 automated production systems such as robotic work cells or embedded systems. The main problem for designers is to find a trade off between minimizing the cost of the resources and maximizing the system's throughput. It is possible to apply analytical techniques for the average cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the average cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value.
Year
DOI
Venue
2015
10.1109/CoASE.2015.7294075
2015 IEEE International Conference on Automation Science and Engineering (CASE)
Keywords
Field
DocType
cycle time optimization,deterministic timed weighted marked graph,Petri net,cyclic manufacturing system,automated production system
Graph theory,Graph,Petri net,Manufacturing systems,Computer science,Server,Theoretical computer science,Throughput,Optimization problem,Semantics,Distributed computing
Conference
ISSN
Citations 
PageRank 
2161-8070
1
0.35
References 
Authors
8
3
Name
Order
Citations
PageRank
Zhou He1154.62
ZhiWu Li21863113.66
Alessandro Giua31836199.57