algorithm - Matching a combination of applicants to positions of a job based on their skills -
essentially have job fixed number of positions 3 or 6 , n applicants.
the job requires number of skills skills a,b,c,...z.
applicants have skills job requires not skills.
what i'm struggling constructing algorithm match 3 or 6 applicants such combined skills fulfills many skills job requires situations. optimistically fulfilling of them @ worst many of them possible
if similar or same type of algorithm let me know can't figure out how research this.
i've tried thinking of solution adding person has skills job requires trying find person has skills person 1 didn't have job requires. falls apart if solution combination of people "medium" amount of skills.
i thought of turning each applicants skills binary 1 or 0 signify if have i'm struggling turn useful. think doing might on right track.
this isn't specific algorithm, 1 approach these sorts of problems use constraint solver/optimizer. example, in java use optaplanner.
these declarative systems, instead of explaining algorithm have program problem is. describe state space, , constraints or not solution. run it, , tell if found solution , solution found.
Comments
Post a Comment