A queueing model of general servers in tandem with finite buffer capacities
From MaRDI portal
Publication:3436617
zbMATH Open1115.90327MaRDI QIDQ3436617FDOQ3436617
Publication date: 11 May 2007
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (6)
- A mathematical modelling approach for systems where the servers are almost always busy
- Finite-buffer queues with workload-dependent service and arrival rates
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Effect of Routing and Buffer Sharing on the Behavior of a Finite Queue with Batch Poisson Inputs and Synchronous Servers
- Queueing-model based analysis of assembly lines with finite buffers and general service times
Recommendations
- A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity 👍 👎
- Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers 👍 👎
- Modeling and analysis of multiple-class tandem queuing systems with finite capacities 👍 👎
- Tandem Queues with Correlated Service Times and Finite Capacity 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: A queueing model of general servers in tandem with finite buffer capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3436617)
