On heuristic methods of decomposing a set of intertwined processes

The paper is concerned with decomposition of a set of intertwined processes into a fixed number of relatively autonomous subsets, which is necessary in various technological fields. For most widely used heuristic ways to perform this task the properties are studied and estimates of the worst behaviour are obtained. The meaningfulness of estimates is analyzed in a computing experiment.