Multiple finite source queueing model with dynamic priority scheduling

Phadhana Tosirisuk, M. Jeya Chandra

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang, or hyperexponential probability density function, with the same mean regardless of the class. Using an extension of mean value analysis, a recursive algorithm is developed to obtain approximate values of the mean waiting time in queues for each priority class. The mean number of waiting customers and the server utilization of each priority class can be obtained using the result of this recursive algorithm and Little's formula. Numerical examples are presented to illustrate the methodology. The algorithm developed in this article is validated using simulation.

Original languageEnglish (US)
Pages (from-to)365-381
Number of pages17
JournalNaval Research Logistics (NRL)
Volume37
Issue number3
DOIs
StatePublished - Jan 1 1990

Fingerprint

Queueing Model
Customers
Scheduling
Recursive Algorithm
Servers
Queue
Value engineering
Mean Value Analysis
Probability density function
Single Server
Waiting Time
Server
Numerical Examples
Queueing model
Methodology
Class
Simulation
Recursive algorithm

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this

Tosirisuk, Phadhana ; Chandra, M. Jeya. / Multiple finite source queueing model with dynamic priority scheduling. In: Naval Research Logistics (NRL). 1990 ; Vol. 37, No. 3. pp. 365-381.
@article{f24946ec065e4d4483413f85def2a8d9,
title = "Multiple finite source queueing model with dynamic priority scheduling",
abstract = "This article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang, or hyperexponential probability density function, with the same mean regardless of the class. Using an extension of mean value analysis, a recursive algorithm is developed to obtain approximate values of the mean waiting time in queues for each priority class. The mean number of waiting customers and the server utilization of each priority class can be obtained using the result of this recursive algorithm and Little's formula. Numerical examples are presented to illustrate the methodology. The algorithm developed in this article is validated using simulation.",
author = "Phadhana Tosirisuk and Chandra, {M. Jeya}",
year = "1990",
month = "1",
day = "1",
doi = "10.1002/nav.3800370303",
language = "English (US)",
volume = "37",
pages = "365--381",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

Multiple finite source queueing model with dynamic priority scheduling. / Tosirisuk, Phadhana; Chandra, M. Jeya.

In: Naval Research Logistics (NRL), Vol. 37, No. 3, 01.01.1990, p. 365-381.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multiple finite source queueing model with dynamic priority scheduling

AU - Tosirisuk, Phadhana

AU - Chandra, M. Jeya

PY - 1990/1/1

Y1 - 1990/1/1

N2 - This article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang, or hyperexponential probability density function, with the same mean regardless of the class. Using an extension of mean value analysis, a recursive algorithm is developed to obtain approximate values of the mean waiting time in queues for each priority class. The mean number of waiting customers and the server utilization of each priority class can be obtained using the result of this recursive algorithm and Little's formula. Numerical examples are presented to illustrate the methodology. The algorithm developed in this article is validated using simulation.

AB - This article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang, or hyperexponential probability density function, with the same mean regardless of the class. Using an extension of mean value analysis, a recursive algorithm is developed to obtain approximate values of the mean waiting time in queues for each priority class. The mean number of waiting customers and the server utilization of each priority class can be obtained using the result of this recursive algorithm and Little's formula. Numerical examples are presented to illustrate the methodology. The algorithm developed in this article is validated using simulation.

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

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

U2 - 10.1002/nav.3800370303

DO - 10.1002/nav.3800370303

M3 - Article

VL - 37

SP - 365

EP - 381

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 3

ER -