Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/1 queue under random order service discipline
DOI10.1007/S10479-017-2534-ZzbMATH Open1388.90040OpenAlexW2624549744MaRDI QIDQ1708522FDOQ1708522
Authors: Souvik Ghosh, A. D. Banik 
Publication date: 23 March 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2534-z
Recommendations
- WAITING TIME ANALYSIS OF M^X/G/1 QUEUES WITH/WITHOUT VACATIONS UNDER RANDOM ORDER OF SERVICE DISCIPLINE
- Analysis of the BMAP/SM/1/N type system with randomized choice of customers admission discipline
- Random-order-of-service for heterogeneous customers: waiting time analysis
- Processor-sharing and random-service queues with semi-Markovian arrivals
- When random-order-of-service outperforms first-come-first-served
RG-factorizationbatch Markovian arrival process (BMAP)Markovian service process (MSP)expected sojourn timerandom order service (ROS)
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queues and service in operations research (90B22)
Cites Work
- Title not available (Why is that?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Applied Probability and Queues
- Title not available (Why is that?)
- New results on the single server queue with a batch markovian arrival process
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A versatile Markovian point process
- Numerical investigation of a multiserver retrial model
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
- A factorization property for \(BMAP/G/1\) vacation queues under variable service speed
- Planning and Scheduling in Manufacturing and Services
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- The waiting time distribution for the random order service \(M/M/1\) queue
- The equivalence between processor sharing and service in random order.
- Title not available (Why is that?)
- The N/G/1 queue and its detailed analysis
- Queues with Service in Random Order
- A decomposition theorem for infinite stochastic matrices
- Sojourn-time distribution of the \(G I/M S P/1\) queueing system
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
- Sojourn time distribution in a MAP/M/1 processor-sharing queue
- A NOTE ON THE RESPONSE TIME IN M/G/1 QUEUES WUTH SERVICE IN RANDOM ORDER AND BERNOULLI FEEDBACK
- When random-order-of-service outperforms first-come-first-served
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- Random-order-of-service for heterogeneous customers: waiting time analysis
- Priority Queues with Random Order of Service
Cited In (6)
- Detailed analytical and computational studies of \(D-BMAP/D-BMSP1\) queueing system
- Random-order-of-service for heterogeneous customers: waiting time analysis
- Title not available (Why is that?)
- A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
- On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system
- When random-order-of-service outperforms first-come-first-served
This page was built for publication: Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708522)
