Sequencing problems in methods of organising construction processes

This paper presents the algorithm of construction work graphic schedule which considers the proper sequencing problem. Describes the algorithm step by step, i.e. the construction work organisation methods with zero couplings between realisation means, work fronts, and their combination. It also shows the calculation process of limit possible minimum by considering technical and organisation limits. In the second part of the paper, the practical example which shows the method and the optimisation algorithm for the work organisation method with zero couplings between realisation means is presented.