On some LP problems for performance evaluation of timed marked graphs

DOI10.1109/9.280791zbMath0809.90087OpenAlexW2128644921MaRDI QIDQ4306743

Takeo Yamada, Seiji Kataoka

Publication date: 21 September 1994

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.280791

zbMATH Keywords

performance evaluation of timed marked graphs

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A resource allocation problem on timed marked graphs: a decomposition approach ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization

This page was built for publication: On some LP problems for performance evaluation of timed marked graphs