Calculation of the steady state waiting time distribution in the context of the machine interference problem Online publication date: Wed, 13-Jul-2016
by Gregory Gurevich; Yossi Hadad; Baruch Keren
International Journal of Operational Research (IJOR), Vol. 26, No. 4, 2016
Abstract: This paper proposes an extension of a multinomial model for the machine interference problem, where each of N identical machines randomly requests several different service types. Each request for a service is fulfilled by an operator who can provide only one type of service. The extended model is useful for the case in which there is a time limit for one service type (or more), such that it must be accomplished within a certain time from the moment of the request. A delay in the service above a given time spoils the product and makes it useless for its intended purpose. The model allows calculation of the exact distribution function of the steady state waiting time and total service time (waiting time + service time) for each type of requested service, for the first come first served (FCFS) queue discipline.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com