A Time-Sharing Queue with a Finite Number of Customers-Reference-Cited by-同舟云学术

A Time-Sharing Queue with a Finite Number of Customers

Published:1969-04 Issue:2 Volume:16 Page:315-323
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Adiri I.¹,Avi-Itzhak B.¹

Affiliation:

1. Technion-Israel Institute of Technology, Department of Industrial and Management Engineering, Technion City, Haifa, Israel

Abstract

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321510.321523

Reference8 articles.

1. Time-Shared Computer Operations With Both Interarrival and Service Times Exponential

2. ADIHII I. ANI) AVHTZlIAK B. A time-sharing queue. Oper. Res. Stat. add Econ. Mimeo. Ser. No. 5 Dept of Ind. add Mgt. Eng. Teehnion Haifa Israel. ADIHII I. ANI) AVHTZlIAK B. A time-sharing queue. Oper. Res. Stat. add Econ. Mimeo. Ser. No. 5 Dept of Ind. add Mgt. Eng. Teehnion Haifa Israel.

3. On mean time of stoppage of machines;KNTCI NE, A;Mat. Sb.,1933

4. On time Losses in machinery undergoing interruption;KRONIG R;I. Physica,1943

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal (N, F) policy for queue-dependent and time-sharing machining redundant system;International Journal of Quality & Reliability Management;2017-06-05

2. Initial Data Truncation for Univariate Output of Discrete-Event Simulations Using the Kalman Filter;Management Science;1996-04

3. Metamodeling: Some Additional Examples;The Simulation Metamodel;1996

4. A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics;SIAM Journal on Applied Mathematics;1994-06

5. A Processor-Shared Queue That Models Switching Times: Normal Usage;SIAM Journal on Applied Mathematics;1992-06