This article represents the setting of a generalized task on the assignment based on the classic assignment task (or selection task), inefficiency of the solutions search of the generalized task on assignments with the help of the classical assignment task algorithms. A PC algorithm has been developed and implemented for calculation of the “block indicator” allowing one to find the number of solutions for the generalized task on assignment. The program implementing the algorithm for calculation of the “block indicator” is written on Delphi (Pascal). The results of calculations of the “block indicator” are given for some frequently used combinatorics matrices. Some models of optimization tasks are given connected with a generalized task on assignment: the model for local computer networks, the model for optimization of sales of a commercial company, for use in industry, the model on distribution of part blanks on machines. To study the generalized assignment task, the following combinatorial instrument was used: permanents, the cycle matrices indicator as well as the “block indicator”.