 The discrete analysis of relay-racesEvgenii V. Larkin and Aleksandr N. Privalov International Journal of Industrial and Systems Engineering, 2020, vol. 35, issue 1, 100-113 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. Keywords: relay-race; semi-Markov process; time density sampling; rigid schedule; distributed forfeit; stochastic summation. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:35:y:2020:i:1:p:100-113 Access Statistics for this article More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.