An algorithm for obtaining all maximum fronts in a system of sequencing relations is given and its efficiency is proved. The algorithm makes use of the matrix of the relation ships between the activities: “Some activities must end before any other can start.” Due to this it is not necessary to produce the corresponding network by the selection of an optimal sequence of the activities.