{"action":"opened","issue":{"url":"https://api.github.com/repos/MobiusM/Cleanr/issues/13","repository_url":"https://api.github.com/repos/MobiusM/Cleanr","labels_url":"https://api.github.com/repos/MobiusM/Cleanr/issues/13/labels{/name}","comments_url":"https://api.github.com/repos/MobiusM/Cleanr/issues/13/comments","events_url":"https://api.github.com/repos/MobiusM/Cleanr/issues/13/events","html_url":"https://github.com/MobiusM/Cleanr/issues/13","id":386612451,"node_id":"MDU6SXNzdWUzODY2MTI0NTE=","number":13,"title":"Implement member assignment selection","user":{"login":"MobiusM","id":5289325,"node_id":"MDQ6VXNlcjUyODkzMjU=","avatar_url":"https://avatars1.githubusercontent.com/u/5289325?v=4","gravatar_id":"","url":"https://api.github.com/users/MobiusM","html_url":"https://github.com/MobiusM","followers_url":"https://api.github.com/users/MobiusM/followers","following_url":"https://api.github.com/users/MobiusM/following{/other_user}","gists_url":"https://api.github.com/users/MobiusM/gists{/gist_id}","starred_url":"https://api.github.com/users/MobiusM/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MobiusM/subscriptions","organizations_url":"https://api.github.com/users/MobiusM/orgs","repos_url":"https://api.github.com/users/MobiusM/repos","events_url":"https://api.github.com/users/MobiusM/events{/privacy}","received_events_url":"https://api.github.com/users/MobiusM/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-12-02T23:19:42Z","updated_at":"2018-12-02T23:19:42Z","closed_at":null,"author_association":"OWNER","body":"Members are stored in a DB.\nWe would like all the members to share the burden of cleaning a space equally. Thus, we need to implement some sort of priority queue, taking in consideration the times cleaned in a period of time (year for example) and the availability of the person.\nA person should be able to tell the bot he is unable to perform the cleaning job for the next time queued, and the algorithm should then assign the next person, again, based on times cleaned and availability. The logic seems to be recursive: n members are available, then 1 cannot, so pass n-1 members to the selection algorithm."}}
{"actor":{"display_login":"MobiusM"}}