The Finite Capacity GI/M/1 Queue with Server Vacations

DOI10.1057/jors.1996.101zbMath0855.90059MaRDI QIDQ4888199

Surendra M. Gupta, Fikri Karaesmen

Publication date: 28 October 1996

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.101

zbMATH Keywords

heuristic algorithms; queue length distribution; GI/M/1/K queue

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Profit optimisation of the multiple-vacation machine repair problem using particle swarm optimisation, Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations, Analysis of finite buffer renewal input queue with balking and multiple working vacations, The influence of demand variability on the performance of a make-to-stock queue, Optimal management of the machine repair problem with working vacation: Newton's method, On the \(GI/M/1/N\) queue with multiple working vacations-analytic analysis and computation, Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\), On stochastic decomposition in the \(GI/M/1\) queue with single exponential vacation, Analysis of discrete-time queues with batch renewal input and multiple vacations, A heuristic algorithm for the optimization of \(\mathrm{M}/\mathrm{M}/s\) queue with multiple working vacations, Optimization analysis of the machine repair problem with multiple vacations and working breakdowns