.png){kind=icon}
.png){kind=icon}
Return
On the discrete-time system with server breakdowns: Computational algorithm and optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.09.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper analyzes a discrete-time Geo/Geo/1 queueing system with the server subject to breakdowns and repairs, in which two different possible types of the server breakdowns are considered. In Type 1, the server may break down only when the system is busy, while in Type 2, the server can break down even if the system is idle. The server lifetimes are assumed to be geometrical and the server repair times are also geometric distributions. We model this system by the level-dependent quasi-birth-death (QBD) process and develop computation algorithms of the stationary distribution of the number of customers in the system using the matrix analytic method. The search algorithm for parameter optimization based on a cost model is developed and performed herein. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Breakdowns
Discrete time queue
Matrix analytic approach
Quasi-birth-death
Quasi-Newton method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available