Analysis of queue-length dependent vacations and P-limited service in BMAP/G/1/N systems: stationary distributions and optimal control
Summary: We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of \(L\) customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values \(N^\ast\) of \(N\) or a maximum limit \(\hat{L}^\ast\) of \(\hat{L}\) as the number of customers served during a service period at a minimum cost.
- BMAP/G/1/N queue with vacations and limited service discipline
- The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations
- Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N() under gated-limited discipline
- Analysis of BMAP/R/1 queues under gated-limited service with the Server's single vacation policy
- On finite buffer BMAP/G/1 queue with queue length dependent service
- \(M/G/1/N\) vacation model with varying \(E\)-limited service discipline
- A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A versatile Markovian point process
- AMAP/G/1 Queue with an Underlying Birth–Death Process
- BMAP/G/1/N queue with vacations and limited service discipline
- Calculating the loss probability in aBMAP/G/l/N+1 queue
- Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline
- Control Policies for the MX/G/1 Queueing System
- Finite capacity vacation models with non-renewal input
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- New results on the single server queue with a batch markovian arrival process
- Optimal multithreshold control for a BMAP/G/1 queue with N service modes
- Optimal strategy in N-policy production system with early set-up
- Queueing systems with vacations - a survey
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Some performance measures for vacation models with a batch Markovian arrival process
- Tail asymptotics for the fundamental period in the MAP\(/G/1\) queue
- The BMAP/G/1 vacation queue with queue-length dependent vacation schedule
- The BMAP/GI/1 queue with server set-up times and server vacations
- Time to Reach Buffer Capacity in aBMAPQueue
- Vacation queueing models. Theory and applications
- On finite buffer BMAP/G/1 queue with queue length dependent service
- Analysis of a MAP/PH(1), PH(2)/2 production inventory system under the Bernoulli vacation scheme
- Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N() under gated-limited discipline
- BMAP/G/1/N queue with vacations and limited service discipline
This page was built for publication: Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444206)
