scientific article; zbMATH DE number 35509
DOI10.1002/1520-6750(199204)39:3%3C345::AID-NAV3220390305%3E3.0.CO;2-VzbMATH Open0756.90040MaRDI QIDQ3989983FDOQ3989983
Authors:
Publication date: 28 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- Analysis of a finite MAP/\(G\)/1 queue with group services
- Queues with group arrivals and exhaustive service discipline
- A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services
- A discrete single server queue with Markovian arrivals and phase type group services
- Explicit formulae and convergence rate for the system M α /G/1/N as N→∞
phase-type distributionsingle-server queuemean waiting timestationary queue length densitiessteady-state investigation
Applications of mathematical programming (90C90) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
Cited In (17)
- Queues with group arrivals and exhaustive service discipline
- Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues
- Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP(a,b)/1/N
- Analysis of an MAP/PH/1 queue with flexible group service
- An `\((s,S)\)' inventory in a queueing system with batch service facility
- A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services
- Analysis of a retrial queuing model with MAP arrivals and two types of customers.
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
- Threshold control by a single-server retrial queue with batch arrivals and group services
- On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- Queueing models with optional cooperative services
- Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance
- Analysis of a finite MAP/\(G\)/1 queue with group services
- A discrete single server queue with Markovian arrivals and phase type group services
- Retrial queue with discipline of adaptive permanent pooling
- Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989983)