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.
|Title of host publication||Proceedings of the 4th International Workshop on Discrete Event Systems, University of Cagliary, Cagliari, Sardinia, Italy, August 26-28, 1998|
|Editors||A. Giua, R. Smedinga, M. Spathopoulos|
|Publisher||Institution of Electrical Engineers (IEE)|
|Publication status||Published - 1998|
Scopus subject areas
- Modelling and Simulation
- Management Science and Operations Research