Long‐run availability of a priority system: a numerical approach
Author(s) -
Edmond J. Vanderperre,
Stanislav S. Makhanov
Publication year - 2005
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/mpe.2005.75
Subject(s) - computer science , process (computing) , mathematics , unit (ring theory) , mathematical optimization , mathematics education , operating system
We consider a two-unit cold standby system attended by two repairmen and subjected to a priority rule. In order to describe the random behavior of the twin system, we employ a stochastic process endowed with state probability functions satisfying coupled Hokstad- type differential equations. An explicit evaluation of the exact solution is in general quite intricate. Therefore, we propose a numerical solution of the equations. Finally, particular but important repair time distributions are involved to analyze the long-run availability of the T-system. Numerical results are illustrated by adequate computer-plotted graphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom