A multi-echelon queueing model with dynamic priority scheduling

Amit Gupta, Scott Webster

Research output: Contribution to journalArticle

Abstract

In this paper, we consider a multiple finite source queueing model with multiple servers and a nonpreemptive dynamic priority service discipline. The model consists of several classes of customers each of which calls for service at the service facility after spending a random amount of time at the source. The service facility has several servers for serving all customer classes. The service time of customers is exponentially distributed. A nonpreemptive dynamic priority service discipline is used by the servers. In this type of scheduling, a customer's priority function value increases linearly with actual waiting time in the queue. We propose a recursive algorithm that approximates the mean waiting time in the queue of each type of customer classes. Although our solution is only approximate, results from a variety of test problems indicate that the approximation is quite accurate.

Original languageEnglish (US)
Pages (from-to)86-94
Number of pages9
JournalEuropean Journal of Operational Research
Volume74
Issue number1
DOIs
StatePublished - Apr 7 1994
Externally publishedYes

Fingerprint

Multi-echelon
Queueing Model
scheduling
Servers
customer
Scheduling
Customers
Server
service provider
Waiting Time
Queue
Recursive Algorithm
Value Function
Test Problems
Queueing model
Linearly
time
Approximation
Values
Class

Keywords

  • Markov processes
  • Queues
  • scheduling
  • simulation
  • Stochastic processes

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

A multi-echelon queueing model with dynamic priority scheduling. / Gupta, Amit; Webster, Scott.

In: European Journal of Operational Research, Vol. 74, No. 1, 07.04.1994, p. 86-94.

Research output: Contribution to journalArticle

@article{648c78ad2afe437995c7d844cf2d90f2,
title = "A multi-echelon queueing model with dynamic priority scheduling",
abstract = "In this paper, we consider a multiple finite source queueing model with multiple servers and a nonpreemptive dynamic priority service discipline. The model consists of several classes of customers each of which calls for service at the service facility after spending a random amount of time at the source. The service facility has several servers for serving all customer classes. The service time of customers is exponentially distributed. A nonpreemptive dynamic priority service discipline is used by the servers. In this type of scheduling, a customer's priority function value increases linearly with actual waiting time in the queue. We propose a recursive algorithm that approximates the mean waiting time in the queue of each type of customer classes. Although our solution is only approximate, results from a variety of test problems indicate that the approximation is quite accurate.",
keywords = "Markov processes, Queues, scheduling, simulation, Stochastic processes",
author = "Amit Gupta and Scott Webster",
year = "1994",
month = "4",
day = "7",
doi = "10.1016/0377-2217(94)90206-2",
language = "English (US)",
volume = "74",
pages = "86--94",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - A multi-echelon queueing model with dynamic priority scheduling

AU - Gupta, Amit

AU - Webster, Scott

PY - 1994/4/7

Y1 - 1994/4/7

N2 - In this paper, we consider a multiple finite source queueing model with multiple servers and a nonpreemptive dynamic priority service discipline. The model consists of several classes of customers each of which calls for service at the service facility after spending a random amount of time at the source. The service facility has several servers for serving all customer classes. The service time of customers is exponentially distributed. A nonpreemptive dynamic priority service discipline is used by the servers. In this type of scheduling, a customer's priority function value increases linearly with actual waiting time in the queue. We propose a recursive algorithm that approximates the mean waiting time in the queue of each type of customer classes. Although our solution is only approximate, results from a variety of test problems indicate that the approximation is quite accurate.

AB - In this paper, we consider a multiple finite source queueing model with multiple servers and a nonpreemptive dynamic priority service discipline. The model consists of several classes of customers each of which calls for service at the service facility after spending a random amount of time at the source. The service facility has several servers for serving all customer classes. The service time of customers is exponentially distributed. A nonpreemptive dynamic priority service discipline is used by the servers. In this type of scheduling, a customer's priority function value increases linearly with actual waiting time in the queue. We propose a recursive algorithm that approximates the mean waiting time in the queue of each type of customer classes. Although our solution is only approximate, results from a variety of test problems indicate that the approximation is quite accurate.

KW - Markov processes

KW - Queues

KW - scheduling

KW - simulation

KW - Stochastic processes

UR - http://www.scopus.com/inward/record.url?scp=0028407101&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028407101&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(94)90206-2

DO - 10.1016/0377-2217(94)90206-2

M3 - Article

VL - 74

SP - 86

EP - 94

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -