IDEAS home Printed from https://ideas.repec.org/a/igg/jitpm0/v10y2019i1p21-33.html
   My bibliography  Save this article

A Multi-Agent Optimization Method for Preemptive Resource-Constrained Project Scheduling

Author

Listed:
  • Yongyi Shou

    (School of Management, Zhejiang University, Hangzhou, China)

  • Wenjin Hu

    (Zhejiang University, Hangzhou, China)

  • Changtao Lai

    (Zhejiang University, Hangzhou, China)

  • Ying Ying

    (Zhejiang University, Hangzhou, China)

Abstract

A multi-agent optimization method is proposed to solve the preemptive resource-constrained project scheduling problem in which activities are allowed to be preempted no more than once. The proposed method involves a multi-agent system, a negotiation process, and two types of agents (activity agents and schedule agent). The activity agents and the schedule agent negotiate with each other to allocate resources and optimize the project schedule. Computational experiments were conducted using the standard project scheduling problem sets. Compared with prior studies, results of the proposed method are competitive in terms of project makespan. The method can be extended to other preemptive resource-constrained project scheduling problems.

Suggested Citation

  • Yongyi Shou & Wenjin Hu & Changtao Lai & Ying Ying, 2019. "A Multi-Agent Optimization Method for Preemptive Resource-Constrained Project Scheduling," International Journal of Information Technology Project Management (IJITPM), IGI Global, vol. 10(1), pages 21-33, January.
    • Handle: RePEc:igg:jitpm0:v:10:y:2019:i:1:p:21-33
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITPM.2019010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jitpm0:v:10:y:2019:i:1:p:21-33. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.