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

DOI10.1080/00207729608929231zbMATH Open0849.90121OpenAlexW2092423381MaRDI QIDQ4883825FDOQ4883825

Authors: Hiroshi Shimohata, Seiji Kataoka, Takeo Yamada 

Publication date: 7 November 1996

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

Recommendations

• Some optimization problems for timed marked graphs
• scientific article; zbMATH DE number 4189459
• Marking optimization of weighted marked graphs

zbMATH Keywords

error boundsdiscrete event dynamic systemsjobshopbinary search proceduretimed marked graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• On some LP problems for performance evaluation of timed marked graphs
• Some optimization problems for timed marked graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Allocating resources of weighted T-system for adaptive behaviour
• Optimal synchronization of discrete event dynamic systems via timed marked graphs
• An improved approach for marking optimization of timed weighted marked graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883825)