Algorithm for efficient distribution of applications

Question

Business Informatics

Field: real estate.
Structure: real estate agency.

Now, when a company receives an application for the purchase of real estate, the "executor" is appointed by the office manager manually. The choice of an office manager is not always objective. Allocation to one agent or another may be influenced by personal relationships with the office manager.

Task: come up with an algorithm for automatic efficient distribution of applications among agents.
Question: maybe you don’t need to invent anything and there are already similar algorithms?

Answer 1

To make the choice "objective" - ​​you need to think over a reliable rating system for agents, as well as separate the competencies of agents (evaluate each according to a number of criteria - for example, "ability to sell", "experience with rent/inheritance", etc.) and divide client applications according to their competencies , queue the ticket with estimate waiting if the competent agent is currently busy.
You are unlikely to find a ready-made solution, or you will have to finish it for a long time (for example, OTRS) - rather, you need to write for your specific needs.

Answer 2

What parameters do the performers already have, in addition to the number of applications in the work?

Answer 3

Submit bids to agents by auction, then collect rent every week. Allow secondary market.

Answer 4

I developed CRM myself, so of course I will also implement this algorithm myself.
Yes, I thought about the rating system. But it turns out that then the rating should be calculated automatically. And by what criteria? What parameters to track on the basis of which the rating will be formed?
The following figures come to my mind:

Application response
time Time from application receipt to successful closure
Success/failure ratio. applications
Number of objects entered into the database (by agent)

Answer 5

And what prevents you from giving an open list of those who have not been sorted out - and let them take it themselves, transferring the application to themselves?

Answer 6

The general solution of the problem is the following (in real work):
Preparation:
1. We divide managers into groups 1,2,3, etc. Each manager can be in several groups.
2. Apply a filter to each group. For example, group 1 can only include applications with budget N, and group 2 can only include two-room apartments. The trick is that the filters can intersect, there's nothing wrong with that.
3. Groups line up. In the beginning - the one that did not receive applications for the longest time.
Now the algorithm:
1. A new request arrives.
2. Trying on the condition of getting into the group, the first in turn. If ok, then the application enters the group, and the group goes to the end of the queue. If not, then the one following it is selected, and so on. The group in which the application fell flies to the end of the queue.
3. If the application is in a group, then a specific manager from the group is appointed simply in turn. Again, when he accepted the application, he gets to the end (already in this group). If he did not take the application within a certain time, then it enters the pool available for free taking. If the manager is present in different groups, then he advances in turn in them independently!
Why so difficult? The fact is that managers have different abilities. You can't put weak managers on fat clients. At the same time, moving to fat groups is a serious motivation to work better. Such a system gives good uniformity of distribution + leaves room for motivation by rotating staff between groups. Well, absolute transparency.
An important note - provide a place for those applications that did not go into any of the groups (you never know what you messed up with the filters).