Differenze tra le versioni di "AdminGuide:Service:ACD/en"
| Riga 15: | Riga 15: | ||
* RRMemory: distributes calls in round robin mode among the available operators and rememers the last one it tried to call; | * RRMemory: distributes calls in round robin mode among the available operators and rememers the last one it tried to call; | ||
* RROrdered: as RRMemory but respects the order of the operators in the configuration file; | * RROrdered: as RRMemory but respects the order of the operators in the configuration file; | ||
* Random: the call is presented randomly | * Random: the call is presented randomly among the available operators. | ||
An operator can be a member of several queues with different priorities. If two calls occur at the same time, the service will present to the operator the one belonging to the higher priority queue. | An operator can be a member of several queues with different priorities. If two calls occur at the same time, the service will present to the operator the one belonging to the higher priority queue. | ||
Versione delle 08:26, 25 giu 2018
Return to AdminGuide:Service
Advanced Call Distribution
Description
The ACD service, also known as the wait queue service, lets you offer a professional reception to customers by making use of their waiting time as they wait for a free operator. Queues are similar to ring groups; the main difference is the ability to define ring strategies in more refined ways and the way inbound calls are sorted, according to a FIFO (First In First Out) policy. You can assign an arbitrary number of members (accounts) to each queue. These members will be the ones to answer calls.
The customer will be informed of their estimated waiting time and other customizable information. Once an operator is free, the system will distribute calls according to the selected ring strategy. The available ring strategies are:
- Ringall: the call is presented simultaneously to all free operators in the queue;
- Linear: the call is presented to the first free operator in a predefined sequence;
- Leastrecent: the call is presented to the operator who hasn't answered a call for the longest time;
- Fewestcalls: the call is presented to the operator who has answered the fewest calls;
- RRMemory: distributes calls in round robin mode among the available operators and rememers the last one it tried to call;
- RROrdered: as RRMemory but respects the order of the operators in the configuration file;
- Random: the call is presented randomly among the available operators.
An operator can be a member of several queues with different priorities. If two calls occur at the same time, the service will present to the operator the one belonging to the higher priority queue.
When the ACD service presents a call to an operator, it will inform them of the queue identifier via audio and/or telephone display so that they can best deal with the customer's request.
Within each queue, operators may be assigned different "penalty" values (the lower the value, the greater their ability and therefore the chance of being engaged by the system).