Retractable contract network for empowerment in workforce scheduling

This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It is motivated by BT's workforce scheduling problem, in which multiple service providers have to serve multiple service buyers. The service providers and buyers all attempt to maximize their own utility. The overall problem is a multi-objective optimization problem; for example, one has to maximize completion rates and service quality and minimize travelling distances. Although the work is motivated by BT's business operations, the aim is to develop a general negotiation protocol for staff empowerment. Standard contract net is a practical strategy in distributed scheduling where agents may have conflicting objectives. In this paper, we have introduced a retractable contract net protocol, RECONNET, which supports hill-climbing in the space of schedules. It is built upon a job-release and compensation mechanism. A system based on RECONNET has been implemented for BT's workforce scheduling problem. The software, which we call ASMCR, allows the management to exert full control over the company's multiple objectives. The manager generates a Pareto set of solutions by defining, for each buyer and seller, the weights given to each objective. ASMCR gives service buyers and sellers ownership of their problem and freedom to maximize their performance under the criteria defined by the management. ASMCR was tested on real-sized problems and demonstrated to meet BT's operational time requirement. It has full potential to be further developed for tackling BT's workforce scheduling problem.

[1]  Nanlin Jin,et al.  Games, Supply Chains, and Automatic Strategy Discovery Using Evolutionary Computation , 2006 .

[2]  A. Wilkinson Empowerment: theory and practice , 1998 .

[3]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[4]  Krithi Ramamritham,et al.  Dynamic Task Scheduling in Hard Real-Time Distributed systems , 1984, IEEE Software.

[5]  Jacques L. Koko,et al.  The Art and Science of Negotiation , 2009 .

[6]  Guillermo Ricardo Simari,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 2000 .

[7]  H. V. Parunak Chapter 10 – Manufacturing Experience with the Contract Net , 1987 .

[8]  Samir Aknine,et al.  An Extended Multi-Agent Negotiation Protocol , 2004, Autonomous Agents and Multi-Agent Systems.

[9]  Edmund H. Durfee,et al.  Distributed Problem Solving and Planning , 2001, EASSS.

[10]  H. Simon,et al.  Models of Man. , 1957 .

[11]  Barbara M. Smith,et al.  Trying Harder to Fail First , 1998, ECAI.

[12]  Victor R. Lesser,et al.  Leveled Commitment Contracts and Strategic Breach , 2001, Games Econ. Behav..

[13]  Alan H. Bond,et al.  Readings in Distributed Artificial Intelligence , 1988 .

[14]  Edmund H. Durfee,et al.  A contracting model for flexible distributed scheduling , 1996, Ann. Oper. Res..

[15]  Marian Florin Ursu,et al.  Distributed Resource Allocation via Local Choices: General Model and a Basic Solution , 2004, KES.

[16]  Makoto Yokoo,et al.  Search algorithms for agents , 1999 .

[17]  Kwang Mong Sim,et al.  Equilibria, prudent Compromises,and the "Waiting" game , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Kwang Mong Sim,et al.  Agents that react to changing market situations , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[19]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[20]  Victor R. Lesser,et al.  Leveled-Commitment Contracting: A Backtracking Instrument for Multiagent Systems , 2002, AI Mag..

[21]  Gilbert Owusu,et al.  Intelligent Workforce Allocation within an Agent-based Paradigm: Central and Distributed Decision Powers , 2005, Artificial Intelligence and Applications.

[22]  Klaus Fischer,et al.  Cooperative Transportation Scheduling: An Application Domain for DAI , 1996, Appl. Artif. Intell..

[23]  Eckart Zitzler,et al.  Evolutionary multi-objective optimization , 2007, Eur. J. Oper. Res..

[24]  Jörg P. Müller,et al.  COOPERATIVE TRANSPORTATION SCHEDULING : AN APPLICATION DOMAIN FOR DAI , 1996 .

[25]  Victor R. Lesser,et al.  Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework , 1997, ICMAS.

[26]  K. Thomas,et al.  Cognitive Elements of Empowerment: An “Interpretive” Model of Intrinsic Task Motivation , 1990 .

[27]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[28]  Tuomas Sandholm,et al.  Algorithms for Optimizing Leveled Commitment Contracts , 1999, IJCAI.

[29]  P. Cowling,et al.  Contract Net Protocol for Cooperative Optimisation and Dynamic Scheduling of Steel Production , 2003 .

[30]  Edmund H. Durfee,et al.  The Role of Commitment in Cooperative Negotiation , 1994, Int. J. Cooperative Inf. Syst..

[31]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[32]  Edmund H. Durfee,et al.  A Formal Study of Distributed Meeting Scheduling , 1998 .

[33]  Tuomas Sandholm,et al.  Automated contracting in distributed manufacturing among independent companies , 2000, J. Intell. Manuf..

[34]  Tuomas Sandholm,et al.  Automated Mechanism Design: A New Application Area for Search Algorithms , 2003, CP.

[35]  Nicolas Lhuillier,et al.  FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS , 2003 .

[36]  P. Kline Models of man , 1986, Nature.

[37]  Boi Faltings,et al.  A budget-balanced, incentive-compatible scheme for social choice , 2004, AAMAS'04.

[38]  Raphaël Dorne,et al.  iOpt: A Software Toolkit for Heuristic Search Methods , 2001, CP.

[39]  Edward P. K. Tsang,et al.  A Context for Constraint Satisfaction Problem Formulation Selection , 2001, Constraints.

[40]  Nanlin Jin,et al.  Co-adaptive Strategies for Sequential Bargaining Problems with Discount Factors and Outside Options , 2006, 2006 IEEE International Conference on Evolutionary Computation.