A method for solution of a combinatorial problem of determining the time of factory commissioning

A method is proposed for solution of the subproblem of determining the times for commissioning new factories. The subproblem arises in numerical solution of the dynamic deployment problem in the case where no discounting is made for costs incurred at different times. The method is a decompositional on. The subproblem is divided into finding a «feasible» combination of factories and finding feasible permuations. For both problems branch-and-bound methods with a special structure of estimation, problems are proposed.