Relay-Races with Rigid Schedules

Multistage corporative-concurrent systems organized inside a corporation as conveyor, and outside of corporation as concurrent system, is considered. It is shown, that adequate abstraction for description of such a systems is the M-parallel semi-Markov process, which has a number of specific features due to rigid schedule of conveyor operation, based on the properties of degenerative distribution, which is used for description of time intervals between relay points. Recurrent method of M-parallel semi-Markov process evolution analysis, which accounts for the rigidity of schedule and possibility of three possible competition outcomes (win, lose, draw), is worked out. Using the concept of distributed forfeit and proposed recurrent procedure of rigid schedule relay-races analysis, the method of calculation of summing forfeit, which one of competing teams receives from other teams, is proposed. It is shown, that for a forfeit optimization the exact knowledge of schedules of all competitive teams is essential.