Article ID: | iaor20042342 |
Country: | United Kingdom |
Volume: | 46 |
Issue: | 2/3 |
Start Page Number: | 293 |
End Page Number: | 312 |
Publication Date: | Jul 2003 |
Journal: | Computers & Mathematics with Applications |
Authors: | Sztrik J., Zreikat A.I., Bolch G. |
Keywords: | simulation |
In this paper, we introduce a nonhomogeneous unreliable multiserver system with Markovian arrival, service, breakdown, and repair processes. First, we consider the case with only one queue and different servers and the job is assigned to one server. Then, we extend this model to more than one queue in which the jobs are assigned to different queues. We assume that our system has different servers with different service times and a job is assigned to a server using the following strategies: FFS (fastest free server) or random selection. FFS strategy means that the job is served by the fastest available server, and if this server is busy then the job goes to the next available server and so on. In the random strategy, the job is served by one of the free servers which is chosen randomly. In our problem, we consider a general queueing system (