I am working on an Assigning problem to expert or agent
How can I solve this problem? Can I solve it with multi objective A*? What would be an admissible heuristic function and how to calculate heuristic h(n) function ?how can i design multi objective A* algorithm for this problem please help me.
Consider KK agents A1,…AKA1,…AK and NN tasks T1,…TNT1,…TN. Each task has a certain time t(Ti)t(Ti) to be completed and each agent has a matching (or affinity) value associated with each task MAj(Ti),∀i,jMAj(Ti),∀i,j. The goal is to assign agents to tasks, such that the matching value is maximized and the overall time to complete the tasks is minimized. Moreover, an agent can be assigned to multiple tasks. However, an agent cannot start a new task before finishing the previous one.