Alternating Priority Versus FCFS Scheduling in a Two-Class Queueing System

Steven B. Kramer; Arjang A. Assad

doi:10.1016/j.orl.2012.08.009

Alternating Priority Versus FCFS Scheduling in a Two-Class Queueing System

Steven B. Kramer
, Arjang A. Assad

Research output: Contribution to journal › Article › peer-review

Abstract

For the single-server two-class queueing system studied in the classical text of Conway et al. (1967), we compare the mean flow times for First-Come, First-Served (FCFS) and Alternating Priority (AP) scheduling rules assuming zero setup costs for switching between classes. We show that the condition for the superiority of AP over FCFS stated in that text is incorrect, provide the correct conditions, and establish a lower bound on the difference between the mean flow times under the two rules.

Original language	American English
Article number	6
Pages (from-to)	506-509
Number of pages	4
Journal	Operations Research Letters
Volume	40
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2012.08.009
State	Published - Nov 1 2012

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

ASJC Scopus Subject Areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Keywords

Priority classes
Queueing
Scheduling

Disciplines

Business

Access to Document

10.1016/j.orl.2012.08.009

Cite this

@article{751a8ee55654455fb533fa126a9df5b7,

title = "Alternating Priority Versus FCFS Scheduling in a Two-Class Queueing System",

abstract = " For the single-server two-class queueing system studied in the classical text of Conway et al. (1967), we compare the mean flow times for First-Come, First-Served (FCFS) and Alternating Priority (AP) scheduling rules assuming zero setup costs for switching between classes. We show that the condition for the superiority of AP over FCFS stated in that text is incorrect, provide the correct conditions, and establish a lower bound on the difference between the mean flow times under the two rules.",

keywords = "Priority classes, Queueing, Scheduling",

author = "Kramer, \{Steven B.\} and Assad, \{Arjang A.\}",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2012",

month = nov,

day = "1",

doi = "10.1016/j.orl.2012.08.009",

language = "American English",

volume = "40",

pages = "506--509",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "6",

}

TY - JOUR

T1 - Alternating Priority Versus FCFS Scheduling in a Two-Class Queueing System

AU - Kramer, Steven B.

AU - Assad, Arjang A.

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2012/11/1

Y1 - 2012/11/1

N2 - For the single-server two-class queueing system studied in the classical text of Conway et al. (1967), we compare the mean flow times for First-Come, First-Served (FCFS) and Alternating Priority (AP) scheduling rules assuming zero setup costs for switching between classes. We show that the condition for the superiority of AP over FCFS stated in that text is incorrect, provide the correct conditions, and establish a lower bound on the difference between the mean flow times under the two rules.

AB - For the single-server two-class queueing system studied in the classical text of Conway et al. (1967), we compare the mean flow times for First-Come, First-Served (FCFS) and Alternating Priority (AP) scheduling rules assuming zero setup costs for switching between classes. We show that the condition for the superiority of AP over FCFS stated in that text is incorrect, provide the correct conditions, and establish a lower bound on the difference between the mean flow times under the two rules.

KW - Priority classes

KW - Queueing

KW - Scheduling

UR - https://nsuworks.nova.edu/hcbe_facarticles/594

U2 - 10.1016/j.orl.2012.08.009

DO - 10.1016/j.orl.2012.08.009

M3 - Article

SN - 0167-6377

VL - 40

SP - 506

EP - 509

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

M1 - 6

ER -

Alternating Priority Versus FCFS Scheduling in a Two-Class Queueing System

Abstract

Bibliographical note

ASJC Scopus Subject Areas

Keywords

Disciplines

Access to Document

Other files and links

Fingerprint

Cite this