Bounds on mean cycle time in acyclic fork-join queueing networks
classification
🧮 math.OC
cs.SYeess.SY
keywords
boundsnetworksacycliccyclefork-joinmeantimealgebra
read the original abstract
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the $(\max,+)$-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.