Using Factorization for Waiting Times in BMAP/G/1 Queues with N-Policy and Vacations

DOI10.1081/SAP-120030455zbMath1056.60096OpenAlexW2025383317MaRDI QIDQ3158168

Ho Woo Lee, No Ik Park

Publication date: 20 January 2005

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/sap-120030455

zbMATH Keywords

waiting timemultiple vacationsfactorization principle

Mathematics Subject Classification ID

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

Related Items (3)

Optimal design and control of queues ⋮ Analysis of the manufacturing lead time in a production system with non-renewal batch input, threshold policy and post-operation ⋮ A MAINTENANCE MODEL FOR MANUFACTURING LEAD TIME IN A PRODUCTION SYSTEM WITH BMAP INPUT AND BILEVEL SETUP CONTROL

Cites Work

• Unnamed Item
• A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
• DECOMPOSITIONS OF THE QUEUE LENGTH DISTRIBUTIONS IN THE MAP/G/1 QUEUE UNDER MULTIPLE AND SINGLE VACATIONS WITHN-POLICY
• 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 stable recursion for the steady state vector in markov chains of m/g/1 type
• A versatile Markovian point process
• The N/G/1 queue and its detailed analysis
• Analysis of the M^x/G/1 queue by N-policy and multiple vacations
• A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONS

This page was built for publication: Using Factorization for Waiting Times in BMAP/G/1 Queues with N-Policy and Vacations