A service model in which the server is required to search for customers
Clicks: 96
ID: 270444
1984
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
27.9
/100
96 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #7 of 7 articles by views in journal of applied probability
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Customers enter a pool according to a Poisson process and wait there to be found and processed by a single server. The service times of successive items are independent and have a common general distribution. Successive services are separated by seek phases during which the server searches for the next customer. The search process is Markovian and the probability of locating a customer in (t, t + dt) is proportional to the number of customers in the pool at time t. Various stationary probability distributions for this model are obtained in explicit forms well-suited for numerical computation.Under the assumption of exponential service times, corresponding results are obtained for the case where customers may escape from the pool.
| Reference Key |
ramalhoto1984journala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Marcel F. Neuts,M. F. Ramalhoto;Marcel F. Neuts;M. F. Ramalhoto; |
| Journal | journal of applied probability |
| Year | 1984 |
| DOI |
10.2307/3213673
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.