This post has been de-listed
It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.
Hello,
I would like your help with the following case:
A certain group of people gets assigned a number of tasks, let it be N, each of these tasks can contain various subtasks ranging from 1 to usually 200 to 300 hundred.
Let it be M the total amount of subtask
The algorithm should be able to assign to each member of the group a number of task so that the total amount of subtasks for each one is as evenly distributed as possible.
Especial considerations:
1) You cannot change the amount of subtask that each task contains.
2) Is it possible to get special rules, such as that member "a" of the group only gets 100 subtasks maximum, and the rest are distributed among the remaining members.
Any help would be appreciated.
Subreddit
Post Details
- Posted
- 3 years ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/algorithms/...