Computational analysis of M(n)/G/1/N queues with setup time

DOI10.1016/0305-0548(94)00071-FzbMath0838.90049MaRDI QIDQ1906938

Yixin Zhu, Ping Yang, Hu-An Li

Publication date: 30 May 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

stationary queue length distribution\(M/G/1/N\) queues

Mathematics Subject Classification ID

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

Related Items (3)

\(M(n)/G/1/N\) queues with generalized vacations ⋮ An M\(^{[x}\)/G/1 system with startup server and \(J\) additional options for service] ⋮ Performance analysis of novel overload control with threshold mechanism

Cites Work

• Unnamed Item
• On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots
• Computation of the quasi-stationary distributions in \(M(n)/GI/1/K\) and \(GI/M(n)/1/K\) queues
• Queues Subject to Service Interruption
• On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines
• A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
• The m/g/l queue with queue-length dependent arrival rate
• On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
• On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes

This page was built for publication: Computational analysis of M(n)/G/1/N queues with setup time