DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
From MaRDI portal
Publication:3645155
DOI10.1017/S0269964809000138zbMath1181.60132MaRDI QIDQ3645155
Li Ding, Nilay Tanık Argon, Kevin D. Glazebrook, Serhan Ziya
Publication date: 16 November 2009
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
General notions of indexability for queueing control and asset management, Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing, Multiple-server system with flexible arrivals
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
- Dynamic routing in large-scale service systems with heterogeneous servers
- Optimality of the shortest line discipline with state-dependent service rates
- Optimality of routing and servicing in dependent parallel processing systems
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- Allocation of tasks to specialized processors: A planning approach
- Index policies for the maintenance of a collection of machines by a set of repairmen
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Critical thresholds for dynamic routing in queueing networks
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Joining the right queue: a state-dependent decision rule
- Brownian Networks with Discretionary Routing
- A Call-Routing Problem with Service-Level Constraints
- Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
- On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design
- Deciding Which Queue to Join: Some Counterexamples
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Resource pooling in queueing networks with dynamic routing
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- A Basic Dynamic Routing Problem and Diffusion
- Optimal load balancing and scheduling in a distributed computer system
- A heuristic rule for routing customers to parallel servers
- On the structure of value functions for threshold policies in queueing models
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
- Index policies for a class of discounted restless bandits
- Minimizing response times and queue lengths in systems of parallel queues
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Outsourcing warranty repairs: Dynamic allocation
- Contact Centers with a Call-Back Option and Real-Time Delay Information
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime