A discrete-time queueing system with optional LCFS discipline

被引：0

作者：

I. Atencia

A. V. Pechinkin

机构：

[1] University of Málaga,E.T.S.I. Telecomunicación, Department of Applied Mathematics

[2] Russian Academy of Sciences,Institute of Informatics Problems

来源：

Annals of Operations Research | 2013年 / 202卷

关键词：

Discrete-time; LCFS discipline; Busy period; Sojourn time;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider a discrete-time queueing system in which the arriving customers decide with a certain probability to be served under a LCFS-PR discipline and with complementary probability to join the queue. The arrivals are assumed to be geometrical and the service times are arbitrarily distributed. The service times of the expelled customers are independent of their previous ones.

引用

页码：3 / 17

页数：14

共 20 条

[1]

Atencia I.(2004)The discrete-time Geo/Geo/1 queue with negative customers and disasters Computers and Operations Research 31 1537-1548

[2]

Moreno P.(2005)A single-server G-queue in discrete-time with geometrical arrival and service process Performance Evaluation 59 85-97

[3]

Atencia I.(1996)Analysis of the discrete-time Computers & Mathematics With Applications 31 59-68

[4]

Moreno P.(2002)/ Annals of Operations Research 112 171-183

[5]

Chaudhry M. L.(1992)( Performance Evaluation 14 123-131

[6]

Templeton J. G. C.(1958))/ 1/ Operations Research 6 96-105

[7]

Gupta U. C.(1997) queue Annals of Operations Research 69 299-322

[8]

Fiems D.(2009)Randomly interrupted Annals of Operations Research 172 291-313

[9]

Steyaert B.(1995)− Performance Evaluation 23 261-284

[10]

Bruneel H.(2001)−1 queues: service strategies and stability issues Queueing Systems 38 419-429

← 1 2 →