Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server

DOI10.1155/2013/508045zbMath1276.60102OpenAlexW2013201818WikidataQ58996107 ScholiaQ58996107MaRDI QIDQ361585

Lotfi Tadj, Abdelhak Mezghiche

Publication date: 29 August 2013

Published in: ISRN Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/508045

zbMATH Keywords

unreliable serverbatch arrival queueing systemlinear cost structure

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

On some compound random variables motivated by bulk queues

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal design and control of queues
• Queueing systems with vacations - a survey
• Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
• M/G/1 queues with postponed interruptions
• Generalizations of the stochastic decomposition results for single server queues with vacations
• Optimal Design of Queueing Systems

This page was built for publication: Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server