Decomposition in solving the combinatorial problem of determining plant commissioning schedules

In a numerical method for solution of the dynamic problem of plant deployment decomposition can be used for tacking the combinatorial problem of determining the commisioning time for new plants. One of the resulting problems is finding conbinations of plants; once these are solved the problem of search for a feasible permutation is solved. To solve both, branch-and-bound methods with a special structure of the estimating problems are suggested.