2000 character limit reached
Bounds on mean cycle time in acyclic fork-join queueing networks
Published 7 Dec 2012 in math.OC and cs.SY | (1212.1521v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
