An improved approach for marking optimization of timed weighted marked graphs
作者: Zhou HeMiao LiuZiyue MaZhiwu LiAlessandro Giua
作者单位: 1College of Mechanical and Electrical Engineering, Shaanxi University of Science and Technology
2School of Electro-Mechanical Engineering, Xidian University
3Institute of Systems Engineering, Macau University of Science and Technology
4Department of Electrical and Electronic Engineering, University of Cagliari
刊名: Discrete Event Dynamic Systems, 2019, Vol.29 (2), pp.127-143
来源数据库: Springer Journal
DOI: 10.1007/s10626-019-00278-w
关键词: Timed Petri netsWeighted marked graphsMarking optimizationLinear programming
英文摘要: Abstract(#br)Timed weighted marked graphs are a mathematical formalism suitable to model automated manufacturing systems in which synchronization and bulk services and arrivals appear, such as assembly lines and kanban systems. In this paper, we aim to develop practically efficient methods for the marking optimization of timed weighted marked graphs, a problem which consists in finding an initial resource assignment to minimize the cost of resources under a given requirement on the cycle time. Starting with a live initial marking, we first compute the critical places of a timed weighted marked graph by exploring an equivalent model called timed marked graph. Then, we develop an analytical method to identify the critical circuit of the system to which tokens will be iteratively added....
全文获取路径: Springer  (合作)
分享到:
来源刊物:
影响因子:0.711 (2012)

×