IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p115-13510.1007-s10479-006-0158-9.html
   My bibliography  Save this article

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

Author

Listed:
  • Giuseppe Confessore
  • Stefano Giordani
  • Silvia Rismondo

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. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Giuseppe Confessore & Stefano Giordani & Silvia Rismondo, 2007. "A market-based multi-agent system model for decentralized multi-project scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 115-135, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:115-135:10.1007/s10479-006-0158-9
    DOI: 10.1007/s10479-006-0158-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0158-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0158-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Antonio Lova & Pilar Tormos, 2001. "Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 263-286, February.
    2. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    3. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    4. Paul Klemperer, 1999. "Auction Theory: A Guide to the Literature," Journal of Economic Surveys, Wiley Blackwell, vol. 13(3), pages 227-286, July.
    5. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    6. Klemperer, Paul, 1999. " Auction Theory: A Guide to the Literature," Journal of Economic Surveys, Wiley Blackwell, vol. 13(3), pages 227-86, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. He, Yukang & Jia, Tao & Zheng, Weibo, 2023. "Tabu search for dedicated resource-constrained multiproject scheduling to minimise the maximal cash flow gap under uncertainty," European Journal of Operational Research, Elsevier, vol. 310(1), pages 34-52.
    2. Van Eynde, Rob & Vanhoucke, Mario, 2022. "New summary measures and datasets for the multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(3), pages 853-868.
    3. Adhau, Sunil & Mittal, M.L. & Mittal, Abhinav, 2013. "A multi-agent system for decentralized multi-project scheduling with resource transfers," International Journal of Production Economics, Elsevier, vol. 146(2), pages 646-661.
    4. Fink, Andreas & Gerhards, Patrick, 2021. "Negotiation mechanisms for the multi-agent multi-mode resource investment problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 261-274.
    5. Anıl Can & Gündüz Ulusoy, 2014. "Multi-project scheduling with two-stage decomposition," Annals of Operations Research, Springer, vol. 217(1), pages 95-116, June.
    6. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    7. Lang, Fabian & Fink, Andreas & Brandt, Tobias, 2016. "Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling," European Journal of Operational Research, Elsevier, vol. 248(1), pages 192-203.
    8. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    9. Feifei Li & Zhe Xu, 2018. "A multi-agent system for distributed multi-project scheduling with two-stage decomposition," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-24, October.
    10. Šůcha, Přemysl & Agnetis, Alessandro & Šidlovský, Marko & Briand, Cyril, 2021. "Nash equilibrium solutions in multi-agent project scheduling with milestones," European Journal of Operational Research, Elsevier, vol. 294(1), pages 29-41.
    11. Alessandro Agnetis & Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2020. "Price of anarchy and price of stability in multi-agent project scheduling," Annals of Operations Research, Springer, vol. 285(1), pages 97-119, February.
    12. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    13. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    14. Wuliang Peng & Jiali lin & Jingwen Zhang & Liangwei Chen, 2022. "A bi-objective hierarchical program scheduling problem and its solution based on NSGA-III," Annals of Operations Research, Springer, vol. 308(1), pages 389-414, January.
    15. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    16. Rob Eynde & Mario Vanhoucke, 2020. "Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling," Journal of Scheduling, Springer, vol. 23(3), pages 301-325, June.
    17. He, Naihui & Zhang, David Z. & Yuce, Baris, 2022. "Integrated multi-project planning and scheduling - a multiagent approach," European Journal of Operational Research, Elsevier, vol. 302(2), pages 688-699.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    2. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    3. Gallien, Jérémie. & Wein, Lawrence M., 2003. "Design and analysis of a smart market for industrial procurement," Working papers WP 4137-00., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Jérémie Gallien & Lawrence M. Wein, 2005. "A Smart Market for Industrial Procurement with Capacity Constraints," Management Science, INFORMS, vol. 51(1), pages 76-91, January.
    5. Elendner, Thomas & Femerling, R., 2003. "Allocation of in-house services: Experimental comparison of allocation mechanisms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 577, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Grigoriev, A. & Hiller, B. & Marban, S. & Vredeveld, T. & van der Zwaan, G.R.J., 2010. "Dynamic pricing problems with elastic demand," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    8. Philippe Février & William Roos & Michael Visser, 2005. "The Buyer's Option in Multi‐Unit Ascending Auctions: The Case of Wine Auctions at Drouot," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 14(4), pages 813-847, December.
    9. Zhang, Ning, 2009. "Market performance and bidders' bidding behavior in the New York Transmission Congestion Contract market," Energy Economics, Elsevier, vol. 31(1), pages 61-68, January.
    10. Schamel, Guenter, 2006. "Auction Markets for Specialty Food Products with Geographical Indications," 2006 Annual Meeting, August 12-18, 2006, Queensland, Australia 25606, International Association of Agricultural Economists.
    11. Adhau, Sunil & Mittal, M.L. & Mittal, Abhinav, 2013. "A multi-agent system for decentralized multi-project scheduling with resource transfers," International Journal of Production Economics, Elsevier, vol. 146(2), pages 646-661.
    12. Maréchal, François & Morand, Pierre-Henri, 2011. "First-price sealed-bid auctions when bidders exhibit different attitudes toward risk," Economics Letters, Elsevier, vol. 113(2), pages 108-111.
    13. Erik Eyster & Matthew Rabin, 2005. "Cursed Equilibrium," Econometrica, Econometric Society, vol. 73(5), pages 1623-1672, September.
    14. Mezzetti, Claudio & Pekec, Aleksandar Sasa & Tsetlin, Ilia, 2008. "Sequential vs. single-round uniform-price auctions," Games and Economic Behavior, Elsevier, vol. 62(2), pages 591-609, March.
    15. Wedad Elmaghraby, 2005. "The Effect of Asymmetric Bidder Size on an Auction's Performance: Are More Bidders Always Better?," Management Science, INFORMS, vol. 51(12), pages 1763-1776, December.
    16. Ranaldo, Angelo & Rossi, Enzo, 2016. "Uniform-price Auctions for Swiss Government Bonds: Origin and Evolution," Working Papers on Finance 1609, University of St. Gallen, School of Finance.
    17. Stuart Kells, 2003. "Explaining The Breadth Of Expert Estimate Ranges In Auctions Of Rare Books," Department of Economics - Working Papers Series 873, The University of Melbourne.
    18. Jacob K. Goeree & Theo Offerman, 2003. "Competitive Bidding in Auctions with Private and Common Values," Economic Journal, Royal Economic Society, vol. 113(489), pages 598-613, July.
    19. Marco A. Haan & Lambert Schoonbeek, 2003. "Rent Seeking with Efforts and Bids," Journal of Economics, Springer, vol. 79(3), pages 215-235, July.
    20. Chonawee Supatgiat & John R. Birge & Rachel Q. Zhang, 2002. "Optimal Bidding Strategies in Non-Sealed Bid Online Auctions of Common Products with Quantity Uncertainty," Game Theory and Information 0211005, University Library of Munich, Germany, revised 05 Mar 2003.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:115-135:10.1007/s10479-006-0158-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.