Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\)
From MaRDI portal
Publication:1739354
DOI10.1007/s11009-018-9635-2zbMath1411.90105OpenAlexW2797078482WikidataQ130038289 ScholiaQ130038289MaRDI QIDQ1739354
Publication date: 26 April 2019
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-018-9635-2
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Sojourn-time distribution for \(M/G^a/1\) queue with batch service of fixed size -- revisited ⋮ Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- A simple and complete computational analysis of MAP/R/1 queue using roots
- Travel time estimation and order batching in a 2-block warehouse
- Analyzing an infinite buffer batch arrival and batch service queue under batch-size-dependent service policy
- ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
- Analysis of queueing-time distributions for MAP/DN/1 queue
- Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1
- Characterizations of generalized hyperexponential distribution functions
- A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B + b) Queues Using Roots
This page was built for publication: Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\)
