An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis
From MaRDI portal
Publication:5131461
DOI10.1287/opre.2019.1884zbMath1446.90062OpenAlexW2960512872MaRDI QIDQ5131461
Publication date: 8 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1884
Related Items (3)
OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES ⋮ A survey on skill-based routing with applications to service operations management ⋮ Stationary distributions and convergence for \(M/M/1\) queues in interactive random environment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queuing with future information
- Mathematical methods for financial markets.
- Markov chain models of a telephone call center with call blending
- Point processes and queues. Martingale dynamics
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Using different response-time requirements to smooth time-varying demand for service
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Optimal pricing and admission control in a queueing system with periodically varying param\-eters
- Super-resolution estimation of cyclic arrival rates
- Admission policies for a two class loss system
- Exact Simulation of Point Processes with Stochastic Intensities
- Asymptotically Optimal Controls for Time-Inhomogeneous Networks
- Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs
- Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment
- Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- Bias optimal admission control policies for a multiclass nonstationary queueing system
- Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method
- Analysis, Design, and Control of Queueing Systems
- A Call-Routing Problem with Service-Level Constraints
- On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design
- Optimal control of admission to a quenching system
- Server Staffing to Meet Time-Varying Demand
- Many‐server loss models with non‐poisson time‐varying arrivals
- Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
- BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL
- A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic
- Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations
- Queueing model for call blending in call centers
- Contact Centers with a Call-Back Option and Real-Time Delay Information
- APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
- Rate-Based Daily Arrival Process Models with Application to Call Centers
- Statistical Analysis of a Telephone Call Center
This page was built for publication: An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis
