The N-network model with upgrades

DOI10.1017/S0269964809990222zbMATH Open1189.90048OpenAlexW1980785143MaRDI QIDQ3564635FDOQ3564635

Authors: Douglas G. Down, Mark E. Lewis 

Publication date: 26 May 2010

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964809990222

Recommendations

• Priority queue with customer upgrades
• Modeling and analysis of flexible queueing systems
• Dynamic control of a single-server system when jobs change status
• Start-up class models in multiple-class queues with \(N\)-policy
• Optimal Control of an M/G/1 Priority Queue Via N-Control

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Title not available (Why is that?)
• The cμ rule revisited
• Title not available (Why is that?)
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design
• Contact Centers with a Call-Back Option and Real-Time Delay Information
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• A diffusion approximation for a GI/GI/1 queue with balking or reneging
• Applying a New Device in the Optimization of Exponential Queuing Systems
• Optimal control of a flexible server
• Stability and convergence of moments for multiclass queueing networks via fluid limit models
• A diffusion approximation for a Markovian queue with reneging
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Optimal control of parallel server systems with many servers in heavy traffic

Cited In (9)

• Optimal control of a multiclass queueing system when customers can change types
• Matched queues with flexible and impatient customers
• Asymptotically optimal control of \(N\)-systems with \(H_2^*\) service times under many-server heavy traffic
• Partial flexibility in routeing and scheduling
• Two-class routing with admission control and strict priorities
• Numerical upscaling of discrete network models
• Performance analysis of service systems with priority upgrades
• Priority queue with customer upgrades
• Stability analysis of N-model systems under a static priority rule

This page was built for publication: The \(N\)-network model with upgrades

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564635)