Dynamic control of a single-server system with abandonments

DOI10.1007/s11134-010-9201-2zbMath1230.90106OpenAlexW2131297116MaRDI QIDQ622616

Mark E. Lewis, Ger Koole, Douglas G. Down

Publication date: 3 February 2011

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/4abd7efe-a6b9-4be1-80e9-378a4f23916f

zbMATH Keywords

dynamic programmingpriority rulescontrol of queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)

Related Items (15)

Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments ⋮ Optimal control of a multiclass queueing system when customers can change types ⋮ Server assignment policies in queues with customer abandonments ⋮ Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes ⋮ Dynamic policy for idling time preservation ⋮ Two‐class constrained optimization with applications to queueing control ⋮ The single-server scheduling problem with convex costs ⋮ On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ A Uniformization Approach for the Dynamic Control of Queueing Systems with Abandonments ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ DYNAMIC CONTROL OF A SINGLE-SERVER SYSTEM WHEN JOBS CHANGE STATUS ⋮ \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method

Cites Work

• Unnamed Item
• On priority queues with impatient customers
• A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
• Interchange arguments for classical scheduling problems in queues
• A diffusion approximation for a Markovian queue with reneging
• Continuous-time controlled Markov chains.
• A diffusion approximation for a GI/GI/1 queue with balking or reneging
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
• The cμ/θ Rule for Many-Server Queues with Abandonment
• The cμ rule revisited
• SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
• 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
• Applying a New Device in the Optimization of Exponential Queuing Systems
• Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy
• The Impact of Delay Announcements in Many-Server Queues with Abandonment
• Contact Centers with a Call-Back Option and Real-Time Delay Information
• Admission control for a multi-server queue with abandonment

This page was built for publication: Dynamic control of a single-server system with abandonments