Модель прохождения судов через участок водного пути формирующая расписание в процессе своего выполнения

The model of passage of vessels through a section of the waterway is considered, which independently determines the order of passage of vessels with limited capacity of sections of the track. Such a model will consist of a number of standard algorithmic networks. When composing the schedule in the model, the following preference rules were used: first-come-first-served (that is, if the ship occupied the workplace, this decision is not canceled); The rule of the shortest operation; For the swamps the priority of vessels going downstream (the direction of flow from the source to the drain). An algorithmic network that implements the search for an acceptable schedule must implement the following for conflicting operations: the operation that has started is not interrupted; If several operations simultaneously claim for one workplace (port, reach) and their number is greater than its throughput, then the conflict resolution is carried out in accordance with predefined preference rules or based on the user's decision; If the operation is waiting for the release of the workplace, it does not occupy the resource; The resource is returned immediately after the operation is completed. The considered design of algorithmic networks allows to resolve the conflict, with a simultaneous resource request, to take the resource once, remember that it was received and return it after the end of the operation, then the resource receives a contra-controlling operation for execution. However, the use of this design introduces redundancy into the model, even if it is used only for conflicting operations. The model is presented in the language of algorithmic networks and is implemented in the system of modeling automation KOGNITRON.