The assignment problem is a well-known operations research model. Its various extensions have been applied to the design of distributed computer systems job assignment in telecommunication networks and solving diverse location truck routing and job shop scheduling problems. This paper focuses on a dynamic generalization of the assignment problem where each task consists of a number of units to be performed by an agent or by a limited number of agents at a time. Demands for the task units are stochastic. Costs are incurred when an agent performs a task or a group of tasks and when there is a surplus or shortage of the task units with respect to their demands. We prove that this stochastic continuous-time generalized assignment problem is strongly NP-hard and reduce it to a number of classical deterministic assignment problems stated at discrete time points. On this basis a pseudo-polynomial time combinatorial algorithm is derived to approximate the solution which converges to the global optimum as the distance between the consecutive time points decreases. Lower bound and complexity estimates for solving the problem and its special cases are found.