Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agnetis, A., P.B. Mirchandani, D. Pacciarelli, and A. Pacifici. (2004). “Scheduling Problems with Two Competing Agents.” Operations Research, 52(2), 229–242.

    Article  Google Scholar 

  • Arbib, C. and F. Rossi. (2000). “Optimal Resource Assignment Through Negotiation in a Multi-agent Manufacturing System.” IIE Transactions, 32, 963–974.

    Article  Google Scholar 

  • Brucker, P., A. Drexl, R. Moehring, K. Neumann, and E. Pesch. (1999). “Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods.” European Journal of Operational Research, 112, 3–41.

    Article  Google Scholar 

  • Jennings, N.R. and M. Wooldridge. (1995). “Applying Agent Technology.” Applied Artificial Intelligence, 9, 357–369.

    Google Scholar 

  • Klemperer, P. (1999). “Auction Theory: A Guide to the Literature.” Journal of Economic Surveys, 13, 227–286.

    Article  Google Scholar 

  • Knotts, G., M. Dror, and B.C. Hartman. (2000). “Agent-Based Project Scheduling.” IIE Transactions, 32, 387–401.

    Article  Google Scholar 

  • Kolisch, R. (1996). “Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation.” European Journal of Operational Research, 90, 320–333.

    Article  Google Scholar 

  • Kolisch R. and A. Sprecher. (1996). “PSPLIB-A Project Scheduling Library.” European Journal of Operational Research, 96, 205–216.

    Google Scholar 

  • Kubiak, W., J. Blażewicz, P. Formanowicz, J. Breit, and G. Schmidt. (2002). “Two-Machine Flow Shops with Limited Machine Availability.” European Journal of Operational Research, 136, 528–540.

    Google Scholar 

  • Lova, A. and P. Tormos. (2001). “Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling.” Annals of Operations Research 102, 263–286.

    Article  Google Scholar 

  • Lee, Y.-H., S.R. Kumara, and K. Chatterjee. (2003). “Multiagent Based Dynamic Resource Scheduling for Distributed Multiple Projects Using a Market Mechanism.” Journal of Intelligent Manufacturing, 14, 471–484.

    Article  Google Scholar 

  • McAfee, R.P. and J. McMillan. (1987). “Auctions and Bidding.” Journal of Economic Literature, 25, 699–738.

    Google Scholar 

  • Parkes, D.C. (1999). “iBundle: An Efficient Ascending Price Bundle Auction.” In Proc. of first ACM Conference on Electronic Commerce, pp. 148–157.

  • Rothkopf, M.H., A. Pereč, and R.M. Harstad. (1998). “Computationally Manageable Combinatorial Auctions.” Management Science, 44, 1131–1147.

    Article  Google Scholar 

  • Sandholm, T. (2000). “Approaches to Winner Determination in Combinatorial Auctions.” Elsevier Decision Support System, 28, 165–176.

    Article  Google Scholar 

  • Sandholm, T. and S. Suri. (2000). “Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations.” In Proc. of National Conference on Artificial Intelligence, pp. 90–97.

  • Sandholm, T., S. Suri, A. Gilpin, and D. Levine. (2002). “Winner Determination in Combinatorial Auction Generalizations.” In Proc. of the First International Conference on Autonomous Agents and Multi-Agent Systems.

  • Wellman, M.P., W.E. Walsh, P.R. Wurman, and J.K. MacKie-Mason. (2001). “Auction Protocols for Decentralized Scheduling.” Games and Economic Behavior, 35, 271–303.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Tecnologie Industriali e Automazione, Consiglio Nazionale delle Ricerche, Area della Ricerca di Roma Tor Vergata, Via del Fosso del Cavaliere 100, 00133, Roma, Italy

    Giuseppe Confessore & Silvia Rismondo

  2. Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, Roma, Italy

    Stefano Giordani

Authors
  1. Giuseppe Confessore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Giordani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvia Rismondo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giuseppe Confessore.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Confessore, G., Giordani, S. & Rismondo, S. A market-based multi-agent system model for decentralized multi-project scheduling. Ann Oper Res 150, 115–135 (2007). https://doi.org/10.1007/s10479-006-0158-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0158-9

Keywords

Search

Navigation