Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Dynamic Priority Queue with General Concave Priority Functions

A. Netterman and I. Adiri
Operations Research
Vol. 27, No. 6 (Nov. - Dec., 1979), pp. 1088-1100
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/172085
Page Count: 13
  • Download ($30.00)
  • Cite this Item
A Dynamic Priority Queue with General Concave Priority Functions
Preview not available

Abstract

This paper analyzes mathematically a queueing model where a single server dispenses service to several, m, non-preemptive priority classes. It is assumed that the arrival process of customers who belong to the k class (k customers) is Poisson, and their service times are independent, identical, arbitrarily distributed random variables. The priority degree of a customer at a certain moment is not only a function of his class, but is also a general concave function of the time he has already spent in the system. (The discipline is termed "dynamic-priority.") Upon departure the server selects for service, from the customers present, the one with the highest instantaneous priority degree, breaking ties by the FIFO rule. An implicit function as well as upper and lower bounds on the expected waiting time of k customer are found. The effectiveness of the bounds is demonstrated by a numerical example.

Page Thumbnails

  • Thumbnail: Page 
1088
    1088
  • Thumbnail: Page 
1089
    1089
  • Thumbnail: Page 
1090
    1090
  • Thumbnail: Page 
1091
    1091
  • Thumbnail: Page 
1092
    1092
  • Thumbnail: Page 
1093
    1093
  • Thumbnail: Page 
1094
    1094
  • Thumbnail: Page 
1095
    1095
  • Thumbnail: Page 
1096
    1096
  • Thumbnail: Page 
1097
    1097
  • Thumbnail: Page 
1098
    1098
  • Thumbnail: Page 
1099
    1099
  • Thumbnail: Page 
1100
    1100