Abstract
Obtaining analytic expressions for characteristics in probabilistic systems with finite buffer capacities such as (higher) moments and tail probabilities of stationary waiting times, and blocking probabilities is by no means trivial. This is also true even for a system with deterministic processing times. By using the max–plus algebraic approach in this study, we introduce closed-form formulae for characteristics of stationary waiting time in a complete buffer-sharing m-node tandem system with constant processing times. Numerical examples are also provided.
| Original language | English |
|---|---|
| Pages (from-to) | 403-408 |
| Number of pages | 6 |
| Journal | Operations Research Letters |
| Volume | 45 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Sept 2017 |
Bibliographical note
Publisher Copyright:© 2017 Elsevier B.V.
Keywords
- Blocking probability
- Complete buffer-sharing
- Higher moments
- Max-plus algebra
- Tail probability
- Tandem queue