Workforce management is an important issue for human involved collaboration. When multiple urgent events simultaneously happen at different places with unexpected requirements, administrators should schedule workforce under the consideration of both system and user context, such as event requirements, user qualifications, etc. In this paper, we tackle this challenging problem of scheduling workforce for multiple urgent events. We study the Feasible Workforce Assignment Problem (WAP) that determines whether a system state satisfies the requirements of a given multiple-event scenario. Then, we present an efficient polynomial solution to solve it, with a case study to illustrate the effectiveness of our method.