We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Parallel multi-type many server conjecture.
- Authors
Weiss, Gideon
- Abstract
Patience times are independent, with distributions HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>F</mi><msub><mi>c</mi><mi>i</mi></msub></msub></math> ht which may be defective. We will vary HT <math xmlns="http://www.w3.org/1998/Math/MathML"><mi> </mi></math> ht and vary I N i , keeping HT <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi> </mi><mo stretchy="false">/</mo><mi>N</mi></mrow></math> ht fixed, and denote by HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>Q</mi><mi> </mi></msup></math> ht the corresponding queueing system. There are I N i servers, HT <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>n</mi><msub><mi>s</mi><mi>j</mi></msub></msub><mo>=</mo><msub><mi> </mi><msub><mi>s</mi><mi>j</mi></msub></msub><mi>N</mi></mrow></math> ht are of type HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>s</mi><mi>j</mi></msub></math> ht .
- Subjects
QUEUING theory; LOGICAL prediction; POISSON processes; MARKOV processes; BIPARTITE graphs
- Publication
Queueing Systems, 2022, Vol 100, Issue 3/4, p269
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-022-09742-1