COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS

Abstract

We consider an oriented network of activities characterized by activity times. Applying the theory of relatively closed systems, the network nodes are interpreted as elements and completion times as element outputs. The behavioural relation of each element is written algebraically in operator form. It is shown how the behavioural relation of the system as a whole may be solved in such a way that explicit dependencies of all completion times on the given activity times are obtained. In this process a matrix containing maximum operators is inverted and the operators in the inverse matrix retain their interpretation.

Citation

GRUBBSTRÖM, R.W. and LUNDQUIST, J. (1987), "COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS", Kybernetes, Vol. 16 No. 3, pp. 155-159. https://doi.org/10.1108/eb005764