On the Gittins index in the M/G/1 queue

被引:34
|
作者
Aalto, Samuli [2 ]
Ayesta, Urtzi [1 ,3 ]
Righter, Rhonda [4 ]
机构
[1] LAAS CNRS, Toulouse, France
[2] TKK Helsinki Univ Technol, Espoo, Finland
[3] BCAM Basque Ctr Appl Math, Derio, Spain
[4] Univ Calif Berkeley, Berkeley, CA 94720 USA
关键词
M/G/1; Gittins index policy; Optimal scheduling; Bathtub hazard rate; PROCESSING TIME DISCIPLINE; SERVICE; OPTIMALITY; SYSTEMS; PROOF;
D O I
10.1007/s11134-009-9141-x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
For an M/G/1 queue with the objective of minimizing the mean number of jobs in the system, the Gittins index rule is known to be optimal among the set of non-anticipating policies. We develop properties of the Gittins index. For a single-class queue it is known that when the service time distribution is of type Decreasing Hazard Rate (New Better than Used in Expectation), the Foreground-Background (First-Come-First-Served) discipline is optimal. By utilizing the Gittins index approach, we show that in fact, Foreground-Background and First-Come-First-Served are optimal if and only if the service time distribution is of type Decreasing Hazard Rate and New Better than Used in Expectation, respectively. For the multi-class case, where jobs of different classes have different service distributions, we obtain new results that characterize the optimal policy under various assumptions on the service time distributions. We also investigate distributions whose hazard rate and mean residual lifetime are not monotonic.
引用
收藏
页码:437 / 458
页数:22
相关论文
共 50 条
  • [1] On the Gittins index in the M/G/1 queue
    Samuli Aalto
    Urtzi Ayesta
    Rhonda Righter
    [J]. Queueing Systems, 2009, 63
  • [2] The Gittins Policy in the M/G/1 Queue
    Scully, Ziv
    Harchol-Batter, Mor
    [J]. 2021 19TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), 2021,
  • [3] THE CORRELATED M/G/1 QUEUE
    BOXMA, OJ
    COMBE, MB
    [J]. AEU-ARCHIV FUR ELEKTRONIK UND UBERTRAGUNGSTECHNIK-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 1993, 47 (5-6): : 330 - 335
  • [4] The G/M/1 queue revisited
    Ivo Adan
    Onno Boxma
    David Perry
    [J]. Mathematical Methods of Operations Research, 2005, 62 : 437 - 452
  • [5] The G/M/1 queue revisited
    Adan, I
    Boxma, O
    Perry, D
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2005, 62 (03) : 437 - 452
  • [6] The M/G/1+G queue revisited
    Onno Boxma
    David Perry
    Wolfgang Stadje
    [J]. Queueing Systems, 2011, 67 : 207 - 220
  • [7] The M/G/1+G queue revisited
    Boxma, Onno
    Perry, David
    Stadje, Wolfgang
    [J]. QUEUEING SYSTEMS, 2011, 67 (03) : 207 - 220
  • [8] ON THE M/G/1 QUEUE WITH ADDITIONAL INPUTS
    OTT, TJ
    [J]. JOURNAL OF APPLIED PROBABILITY, 1984, 21 (01) : 129 - 142
  • [9] Hitting time in an m/g/1 queue
    Ross, SM
    Seshadri, S
    [J]. JOURNAL OF APPLIED PROBABILITY, 1999, 36 (03) : 934 - 940
  • [10] THE M/G/1 QUEUE WITH PERMANENT CUSTOMERS
    BOXMA, OJ
    COHEN, JW
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (02) : 179 - 184