A computer-aided control system of distributed production of printed matter which is interpreted as an open queuing network was considered. Optimal resource allocation to the processing network nodes is one of the key problems in this class of systems. An algorithm based on a combination of the branch-and-bound method and simulation was proposed for determining the optimal solution. The branch-and-bound method enables one to establish the direction of search, and simulation is used to verify each step of search. High convergence of the algorithm was corroborated by numerical experiments.