I’m facing a problem and Im having problems to decide/figure-out an approach to solve it. The problem is the following:
Given N phone calls to be made, schedule in a way that the maximum of them be made.
Know Info:
Rules:
I know a little about A.I. and I can recognize this a problem that fits the class, but i just dont know which approach to take… should i use neural networks? Graph search?
PS: this is not a academic question. This a real world problem that im facing.
PS2: Pointing system is still being created… the points here sampled are not the real ones…
PS3: The resulting algol can be executed several times (batch job style) or it can be resolved online depending on the performance…
PS4: My contract states that I will charge the client based on: (amount of calls I place) + (ratio * the duration of the call), but theres a clause about quality of service, and only placing reminders calls is not good for me, because even when reminded, people still forget to attend their appointments… which reduces the “quality” of the service I provide… i dont know yet the exact numbers
This does not seem like a problem for AI.If it were me I would create a set of rules, ordered by priority. Then start filling in the caller’s schedule.
Mabey one of the rules is to assign the shortest duration call types first (to satisfy the “maximum number of calls made” criteria).
This is sounding more and more like a knapsack problem, where you would substitute in call duration and call points for weight and price.