Given a list of reviewers and a list of tasks. Each reviewer should have an equal number of reviews unless a reviewer is requested for a specific task. After each iteration, the review history is stored. Need to design an algorithm to assign reviewers in a round-robin approach and make sure that new potential reviewers won't be primary reviewers for the upcoming tasks as they have the least number of reviewers.
At this moment, I don't have any code just trying to find an approach how to solve a problem with possibly a new reviewer with zero review count. Implementing an algorithm with the static reviewers list would be a problem.
Any ideas would be appreciated. Thanks!
from is there an algorithm to solve a task assignment optimization problem?
No comments:
Post a Comment