hy all, i have some case about graph matching problem

here we are:
we're given a set of office staff P, and a set of jobs J each Job mus be done by one office staff, each staff can do some jobs base on his ability. how to find best way for assign J jobs to P office staff such that each job can done by one staff and we cannot assign to many jobs to some staff (minimum job assignment)

which algorithm can solve this case
it can use dynamic programming or hungarian algorithm to solve this case?
how about the time complexity of this case?

Question

hy all, i have some case about graph matching problem

here we are:
we're given a set of office staff P, and a set of jobs J each Job mus be done by one office staff, each staff can do some jobs base on his ability. how to find best way for assign J jobs to P office staff such that each job can done by one staff and we cannot assign to many jobs to some staff (minimum job assignment)

which algorithm can solve this case
it can use dynamic programming or hungarian algorithm to solve this case?
how about the time complexity of this case?