Optimal Policies for Multi-server Non-preemptive Priority Queues

Authors:
Erol A. Peköz
Affiliations:
School of Management, Boston University, Boston, MA 02215, USA
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 5
Cited 3

An n-server cutoff priority queue

Operations Research
Introduction to queueing networks

Introduction to queueing networks
M/G/c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules

Management Science
The Nonpreemptive Priority Map/G/1 Queue

Operations Research
Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance

Operations Research

Optimizing a priority-discipline queueing model using fuzzy set theory

Computers & Mathematics with Applications
A new technique to optimize the functions of fuzzy profit of queuing models: Application to a queuing model with publicity and renouncement

Computers & Mathematics with Applications
Live-chat agent assignments to heterogeneous e-customers under imperfect classification

ACM Transactions on Management Information Systems (TMIS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of exponential service and inter-arrival times.