Engineering Solution of a Basic Call-Center Model
From MaRDI portal
Publication:3115446
DOI10.1287/mnsc.1040.0302zbMath1232.90159OpenAlexW2143626226MaRDI QIDQ3115446
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1040.0302
Related Items
An approximation analysis for an assembly-like queueing system with time-constraint items ⋮ Heavy-traffic fluid limits for periodic infinite-server queues ⋮ On the \(M_t/M_t/K_t + M_t\) queue in heavy traffic ⋮ Approximate Description of Dynamics of a Closed Queueing Network Including Multi-servers ⋮ The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue ⋮ Security screening queues with impatient applicants: a new model with a case study ⋮ Transient analysis of the Erlang A model ⋮ STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES ⋮ Admission and pricing optimization of on-street parking with delivery bays ⋮ Approximations for the \(M/GI/N +GI\) type call center ⋮ Patient diversion using real-time delay predictions across healthcare facility networks ⋮ Fitting birth-and-death queueing models to data ⋮ BALKING AND RENEGING IN M/G/s SYSTEMS EXACT ANALYSIS AND APPROXIMATIONS ⋮ ESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE'S LAW ⋮ Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers ⋮ Sharing delay information in service systems: a literature survey ⋮ Stabilizing performance in a service system with time-varying arrivals and customer feedback ⋮ Fluid approximations and control of queues in emergency departments ⋮ Workload forecasting for a call center: methodology and a case study ⋮ Two fluid approximations for multi-server queues with abandonments ⋮ Staffing of time-varying queues using a geometric discrete time modelling approach ⋮ An approximation for multi-server queues with deterministic reneging times ⋮ Online scheduling policies for multiclass call centers with impatient customers ⋮ TheM/G/1 Queue with Quasi-Restricted Accessibility ⋮ Efficient and Reliable Computation of Birth-Death Process Performance Measures ⋮ Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue ⋮ Steady-state and first passage time distributions for waiting times in the \(MAP/M/s+G\) queueing model with generally distributed patience times ⋮ Heavy-traffic limits for waiting times in many-server queues with abandonment ⋮ The ``sensitive Markovian queueing system and its application for a call center problem ⋮ Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data ⋮ Modeling abandonment behavior among patients ⋮ Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
