A decompositional algorithm for determining the times of factory commissioning

A decompositional algorithm is proposed for finding the times of commissioning for new factories, a problem which is isolated from the general deployment problem. The decomposition implies isolation of three particular problems, determining a set of sites, of a set of factories, and of an admissible permutation of factories.