Some optimization problems for timed marked graphs

DOI10.1080/00207729408949356zbMath0818.90052OpenAlexW2040190536MaRDI QIDQ4763829

No author found.

Publication date: 17 August 1995

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729408949356

zbMATH Keywords

discrete event dynamic systemstime Petri net

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Stochastic network models in operations research (90B15)

Related Items (1)

A resource allocation problem on timed marked graphs: a decomposition approach

Cites Work

• Performance evaluation of concurrent systems using Petri nets
• Discrete event systems: models and applications. IIASA conference, Sopron, Hungary, August 3-7, 1987
• Performance evaluation of job-shop systems using timed event-graphs
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Performance evaluation of marked graphs by linear programming
• Optimisation of invariant criteria for event graphs

This page was built for publication: Some optimization problems for timed marked graphs