Approximations in finite-capacity multi-server queues by Poisson arrivals
From MaRDI portal
Publication:4181773
DOI10.2307/3213437zbMath0398.60094OpenAlexW2087948682WikidataQ56913943 ScholiaQ56913943MaRDI QIDQ4181773
Sheldon M. Ross, Shirley A. Nozaki
Publication date: 1978
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d8bc72111309fd72b14e39bdfec7e605f1bb8c53
Related Items
Analysis of a finite capacity non preemptive priority queue, Approximations for multi-server queues: System interpolations, On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough, Threshold properties of the \(M/M/1\) queue under T-policy with applications, A queueing-location model with expected service time dependent queueing disciplines, On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems, A multi-station system for reducing congestion in high-variability queues, Multi-server, Finite Waiting Room,M/G/c/KOptimization Models, Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities., BALKING AND RENEGING IN M/G/s SYSTEMS EXACT ANALYSIS AND APPROXIMATIONS, M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS, Design models for unit load storage and retrieval systems using autonomous vehicle technology and resource conserving storage and dwell point policies, Assessing an ambulance service with queuing theory, On the efficiency of `single window', A congested capacitated multi-level fuzzy facility location problem: an efficient drone delivery system, A new procedure to estimate waiting time in \(GI/G/2\) system by server observation, Average waiting time of customers in a priority M/D/k queue with finite buffers, Queueing models for a flexible machining station. I: The diffusion approximation, Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity, Equivalence relations in the approximations for the \(M/G/s/s+r\) queue., Approximate solution for multi-server queueing systems with Erlangian service times
