The discrete analysis of relay-races Online publication date: Thu, 23-Apr-2020
by Evgenii V. Larkin; Aleksandr N. Privalov
International Journal of Industrial and Systems Engineering (IJISE), Vol. 35, No. 1, 2020
Abstract: It is shown that relay-races as a form of concurrency, are widespread in such fields of human activity, as industry, defence, economics, politics, etc. The analytical description of J stages relay-races, in which participate M teams, is considered. The model based on the semi-Markov process theory allows investigating a process evolution in detail but is of little use for computer calculation of forfeit, which the winner team receives from loser teams. To adapt analytical description to computer calculations, the method based on sampling of continual time densities of passing stages is proposed. Due to the method, initial semi-Markov process is converted to semi-Markov process with degenerative distributions, and the task of forfeit calculation is reduced to the task of rigid schedules effectiveness analysis, in which schedules are selected stochastically from the densities samples. Formulae for the stochastic summation of forfeits, is obtained. The results may be used for optimal planning the activity of participant teams when passing the distance.
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 Industrial and Systems Engineering (IJISE):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook