Skip to Main Content
This paper addresses an issue of periodic job shop controlling where concurrent process flows have to compete safely (i.e. being starvation and deadlock-free) for access to shared system resources. A distributed flow control policy that restricts processes to access resources in a system is proposed. The main problem is reduced to determining a pair (a set of priority dispatching rules, an initial processes allocation belonging to the persistent period of a system flow), which can be treated as distributed control procedure. The processes are controlled by a set of dispatching rules that guarantee steady cyclic flow of the processes. Because various process flows lead to diverse values of the resource utilization rate, a proposal of an automated prototyping procedure of a system is considered. The prototyping procedure allows determining desired system flows for assumed factors such as system capacity or the value of rate of resource utilization. Thanks to determining the pair (a set of priority dispatching rules, an initial processes allocation belonging to the persistent period of a system flow) the result of this paper can be used along with the max-plus algebra formalism for an automated system flow prototyping.