Abstract
The (max,+)-algebra approach is applied to establish some monotonicity properties and to get algebraic bounds on the service cycle completion times in acyclic fork-join queueing networks. The obtained results are extended to derive simple lower and upper bounds on the mean cycle time in stochastic networks.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2nd IMACS International Conference on Circuits, Systems and Computers (IMACS-CSC'98), Volume 2 |
| Editors | Nikos E. Mastorakis |
| Publisher | WSEAS - World Scientific and Engineering Academy and Society |
| Pages | 831-836 |
| ISBN (Print) | 960-8485-06-1 |
| Publication status | Published - 1998 |
Scopus subject areas
- Modelling and Simulation
- Management Science and Operations Research
- Algebra and Number Theory