Some aspects of stationary characteristics and optimal control of the BMAP / G - G / 1 / N( ) oscillating queueing system
From MaRDI portal
Publication:6574708
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
- A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks
- 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
- Control Policies for the MX/G/1 Queueing System
- 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
- Regenerative Analysis and Steady State Distributions for Markov Chains
- The M-M/G/1-type oscillating systems
- The M/G-G/1 oscillating queueing system
- The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process
This page was built for publication: Some aspects of stationary characteristics and optimal control of the \(BMAP / G - G / 1 / N( \infty )\) oscillating queueing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574708)
