SANet: a service-agent network for call-center scheduling

We consider a network of service-providing agents, where different agents have different capabilities, availability, and cost to solve problems. These characteristics are particularly important in practice for semi-automated call centers which provide quality customer service in real time. We have developed SANet, a service agent network for call center automation, to serve as an experimental testbed for our research. SANet can select appropriate agents to provide better solutions for customer problems according to the changing capabilities and availability of service agents in the network. It can also add or delete appropriate agents to balance problem-solving quality, efficiency, and cost according to the number and types of incoming customer problems. On this network, each service agent can be a human service agent, an automated software service agent, or a combination of the two. This paper describes the architecture, a problem scheduling algorithm and an agent assignment algorithm on the SANet. We highlight an application in which we apply SANet to a call-center scheduling problem for a cable-TV company. Finally, we show the efficiency and adaptability of our system via experimental results and discuss related works.

[1]  Donald F. Towsley,et al.  On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks , 1996, IEEE Trans. Computers.

[2]  Qiang Yang,et al.  Towards Lifetime Maintenance of Case Based Indexes for Continual Case Based Reasoning , 1998, AIMSA.

[3]  Craig A. Knoblock,et al.  Query processing in the SIMS information mediator , 1997 .

[4]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[5]  Jan Jonsson,et al.  Evaluation and comparison of task allocation and scheduling methods for distributed real-time systems , 1996, Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (held jointly with 6th CSESAW and 4th IEEE RTAW).

[6]  Greg N. Frederickson.  A Note on the Complexity of a Simple Transportation Problem , 1993, SIAM J. Comput..

[7]  Craig A. Knoblock,et al.  Retrieving and Integrating Data from Multiple Information Sources , 1993, Int. J. Cooperative Inf. Syst..

[8]  Michael P. Wellman.  A computational market model for distributed configuration design , 1994, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[9]  Don Towsley,et al.  Optimal Routing and Scheduling of Customers with Deadlines , 1994, Probability in the Engineering and Informational Sciences.

[10]  Victor R. Lesser,et al.  BIG: An agent for resource-bounded information gathering and decision making , 2000, Artif. Intell..

[11]  V. Lesser,et al.  BIG: A Resource-Bounded Information Gathering Agent , 1998, AAAI/IAAI.

[12]  Jacek M. Zurada,et al.  Introduction to artificial neural systems , 1992 .

[13]  Danny B. Lange,et al.  Programming and Deploying Java¿ Mobile Agents with Aglets¿ , 1998 .

[14]  Timothy W. Finin,et al.  KQML as an agent communication language , 1994, CIKM '94.

[15]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[16]  R. Faure,et al.  Introduction to operations research , 1968 .

[17]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[18]  Marian H. Nodine,et al.  Experience with the InfoSleuth Agent Architecture , 1998 .