A market-based multi-agent system model for decentralized multi-project scheduling

We consider a multi-project scheduling problem, where each project is composed of a set of activities, with precedence relations, requiring specific amounts of local and shared (among projects) resources. The aim is to complete all the project activities, satisfying precedence and resource constraints, and minimizing each project schedule length. The decision making process is supposed to be decentralized, with as many local decision makers as the projects. A multi-agent system model, and an iterative combinatorial auction mechanism for the agent coordination are proposed. We provide a dynamic programming formulation for the combinatorial auction problem, and heuristic algorithms for both the combinatorial auction and the bidding process. An experimental analysis on the whole multi-agent system model is discussed.

[1]  Soundar R. T. Kumara,et al.  Multiagent based dynamic resource scheduling for distributed multiple projects using a market mechanism , 2003, J. Intell. Manuf..

[2]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[3]  Subhash Suri,et al.  Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.

[4]  Tuomas Sandholm,et al.  Approaches to winner determination in combinatorial auctions , 2000, Decis. Support Syst..

[5]  P. Klemperer.  Auction Theory: A Guide to the Literature , 1999 .

[6]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[7]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[8]  Claudio Arbib,et al.  Optimal resource assignment through negotiation in a multi-agent manufacturing system , 2000 .

[9]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[10]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[11]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[12]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[13]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[14]  Moshe Dror,et al.  Agent-based project scheduling , 2000 .

[15]  Nicholas R. Jennings,et al.  Applying agent technology , 1995, Appl. Artif. Intell..

[16]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[17]  María Pilar Tormos,et al.  Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling , 2001, Ann. Oper. Res..

[18]  Phz eMKMLafgZ,et al.  iBundle: An Efficient Ascending Price Bundle Auction , 1999 .