Dynamic programming algorithm of a sort of optimal assignment problem

This paper presents a sort of dynamic programming algorithm for the following generalized optimal assignment problem. There are n persons to be assigned to do m jobs. Each job can only be done by one person, and the ith person can do bi jobs, at the same time, where bi is an unknown positive integer to be calculated. Assuming di≤bi≤ei, di and ei are upper and lower limits of job number required by ith person. The time of ith person's doing jth job is cij≥0(i=1, 2, …, n; j=1, 2 …, m). This paper establishes a dynamic programming algorithm for the above problem.