APPROXIMATING QUEUE LENGTHS IN M(T)/D/1 QUEUES

被引：5
作者：
ALFA, AS
机构：
[1] UNIV MANITOBA,INST TRANSPORT,WINNIPEG R3T 2N2,MANITOBA,CANADA
[2] UNIV MANITOBA,DEPT CIVIL ENGN,WINNIPEG R3T 2N2,MANITOBA,CANADA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 44卷 / 01期
关键词：
approximations; maximum entropy; Queues;
D O I：
10.1016/0377-2217(90)90314-2
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
A technique is presented for approximating queue lengths in a single server queue with time-varying Poisson input and constant service times. The approximation is based on using the Maximum Entropy Principle to estimate the emptiness probabilities which play a significant role in studying queues of this class. The results of the approximation and exact method are compared. © 1990.
引用
收藏
页码：60 / 66
页数：7
相关论文
共 6 条
[1]   NONSTATIONARY QUEUING PROBABILITIES FOR LANDING CONGESTION OF AIRCRAFT [J].
GALLIHER, HP ;
WHEELER, RC .
OPERATIONS RESEARCH, 1958, 6 (02) :264-275
[2]   MAXIMUM-ENTROPY CONDITION IN QUEUING THEORY [J].
GUIASU, S .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1986, 37 (03) :293-301
[3]   INFORMATION THEORETIC APPROXIMATIONS FOR SINGLE-SERVER QUEUING-SYSTEMS [J].
GUPTA, Y ;
DHARMADHIKARI, A ;
BECTOR, CR ;
CHOW, WS .
COMPUTERS & INDUSTRIAL ENGINEERING, 1987, 12 (01) :23-38
[4]   DISCRETE-TIME SINGLE-SERVER QUEUE WITH TIME INHOMOGENEOUS COMPOUND POISSON INPUT AND GENERAL SERVICE TIME DISTRIBUTION [J].
MINH, DL .
JOURNAL OF APPLIED PROBABILITY, 1978, 15 (03) :590-601
[5]  
SHORE JE, 1982, ACTA INFORM, V17, P43, DOI 10.1007/BF00262975
[6]  
SHORE JE, 1978, NATIONAL COMPUTER C, V47, P483
1