Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (Q1708522): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-017-2534-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2624549744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Probability and Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factorization property for \(BMAP/G/1\) vacation queues under variable service speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence between processor sharing and service in random order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queues with Service in Random Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>/<i>G</i>/1 queue and its detailed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Queues with Random Order of Service / rank
 
Normal rank
Property / cites work
 
Property / cites work: The waiting time distribution for the random order service \(M/M/1\) queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for infinite stochastic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Matrix Analytic Methods in Stochastic Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An<i>RG</i>-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the single server queue with a batch markovian arrival process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-server queue with server vacations and a class of non-renewal arrival processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn time distribution in a MAP/M/1 processor-sharing queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: A versatile Markovian point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical investigation of a multiserver retrial model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling in Manufacturing and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-order-of-service for heterogeneous customers: waiting time analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: When random-order-of-service outperforms first-come-first-served / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn-time distribution of the \(G I/M S P/1\) queueing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON THE RESPONSE TIME IN M/G/1 QUEUES WUTH SERVICE IN RANDOM ORDER AND BERNOULLI FEEDBACK / rank
 
Normal rank

Latest revision as of 08:19, 15 July 2024

scientific article
Language Label Description Also known as
English
Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline
scientific article

    Statements

    Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (English)
    0 references
    0 references
    0 references
    23 March 2018
    0 references
    batch Markovian arrival process (BMAP)
    0 references
    Markovian service process (MSP)
    0 references
    random order service (ROS)
    0 references
    RG-factorization
    0 references
    expected sojourn time
    0 references
    0 references
    0 references
    0 references

    Identifiers