Optimisation of invariant criteria for event graphs
作者： S. Laftit , J.-M. Proth , X.-L. Xie
DOI: 10.1109/9.135488
关键词:
摘要: The problem of obtaining a cycle time that is smaller than given value in strongly connected event graph, while minimizing an invariant linear criterion, addressed. This criterion based on p-invariant the graph under consideration. Some properties optimal solution are proved, and heuristic algorithm exact which make it possible to reach given. Applications results evaluation job shops Kanban systems proposed. >
sci-hub.se 参考文章(6)
VAN NGUYEN, HOANG TUY, Convergent Algorithms for Minimizing a Concave Function Mathematics of Operations Research. ,vol. 5, pp. 556- 566 ,(1980) , 10.1287/MOOR.5.4.556
Joseph Sifakis, A unified approach for studying the properties of transition systems Theoretical Computer Science. ,vol. 18, pp. 227- 258 ,(1982) , 10.1016/0304-3975(82)90067-6
T. Murata, Petri nets: Properties, analysis and applications Proceedings of the IEEE. ,vol. 77, pp. 541- 580 ,(1989) , 10.1109/5.24143
H.P. Hillion, J.-M. Proth, Performance evaluation of job-shop systems using timed event-graphs IEEE Transactions on Automatic Control. ,vol. 34, pp. 3- 9 ,(1989) , 10.1109/9.8644
C.V. Ramamoorthy, G.S. Ho, Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets IEEE Transactions on Software Engineering. ,vol. SE-6, pp. 440- 449 ,(1980) , 10.1109/TSE.1980.230492
Harold P. Benson, A finite algorithm for concave minimization over a polyhedron Naval Research Logistics Quarterly. ,vol. 32, pp. 165- 177 ,(1985) , 10.1002/NAV.3800320119