IDEAS home Printed from https://ideas.repec.org/a/bao/ijieis/v1y2021i3p48-64id29.html
   My bibliography  Save this article

A Competitive Nature-Inspired Cuckoo Search Algorithm for Solving the Resource Constrained Project Scheduling Problem

Author

Listed:
  • Seyed Taha Hossein Mortaji
  • Mohammadreza Hosseinzadeh

Abstract

Since its advent, the resource constrained project scheduling problem has been a favorite NP-Hard problem studied by many researchers. In this paper, we examine this problem with a focus on the total project time minimization, usually known as the makespan minimization. To this end, a nature-inspired Cuckoo Search Algorithm (CSA) has been introduced that works by simulating the brooding parasitism of some cuckoo birds in nature. In a nutshell, the proposed cuckoo search algorithm has two main capabilities including: a) a global random search using Levy flights, and b) a local random refinement strategy. In addition, a double justification method has been employed to improve the generated solutions. Simultaneous use of these features can maximize the efficiency of resource searches in uncertain environments. Experimental results on the standard J30, J60, and J120 test sets from the PSPLIB are also presented, showing that the CSA has satisfying results compared with the other well-reported algorithms.

Suggested Citation

  • Seyed Taha Hossein Mortaji & Mohammadreza Hosseinzadeh, 2021. "A Competitive Nature-Inspired Cuckoo Search Algorithm for Solving the Resource Constrained Project Scheduling Problem," International Journal of Innovation in Engineering, International Scientific Network (ISNet), vol. 1(3), pages 48-64.
    • Handle: RePEc:bao:ijieis:v:1:y:2021:i:3:p:48-64:id:29
    as

    Download full text from publisher

    File URL: https://ijie.ir/index.php/ijie/article/view/29/33
    Download Restriction: no
    ---><---

    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:bao:ijieis:v:1:y:2021:i:3:p:48-64:id:29. 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: International Scientific Network (ISNet) (email available below). General contact details of provider: https://ijie.ir/index.php/ijie/ .

    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.