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

DOI10.1080/00207729608929231zbMath0849.90121OpenAlexW2092423381MaRDI QIDQ4883825

Seiji Kataoka, Takeo Yamada, Hiroshi Shimohata

Publication date: 7 November 1996

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

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

zbMATH Keywords

error boundsdiscrete event dynamic systemsjobshopbinary search proceduretimed marked graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Performance evaluation of concurrent systems using Petri nets
• Performance evaluation of job-shop systems using timed event-graphs
• Finitely recursive process models for discrete event systems
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Performance evaluation of marked graphs by linear programming
• Optimisation of invariant criteria for event graphs
• Optimal synchronization of discrete event dynamic systems via timed marked graphs
• On some LP problems for performance evaluation of timed marked graphs
• Some optimization problems for timed marked graphs
• Comparison properties of stochastic decision free Petri nets
• More on Min-Max Allocation

This page was built for publication: A resource allocation problem on timed marked graphs: a decomposition approach