IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v10y2019i4p1-24.html
   My bibliography  Save this article

A Permutation-Based Bees Algorithm for Solving Resource-Constrained Project Scheduling Problem

Author

Listed:
  • Mohamed Amine Nemmich

    (Department of Computer Science, University Mustapha Stambouli of Mascara, Mascara, Algeria)

  • Fatima Debbat

    (Department of Computer Science, University Mustapha Stambouli of Mascara, Mascara, Algeria)

  • Mohamed Slimane

    (Université de Tours, Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Tours, France)

Abstract

In this article, a novel Permutation-based Bees Algorithm (PBA) is proposed for the resource-constrained project scheduling problem (RCPSP) which is widely applied in advanced manufacturing, production planning, and project management. The PBA is a modification of existing Bees Algorithm (BA) adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts. The algorithm treats the solutions of RCPSP as bee swarms and employs the activity-list representation and moves operators for the bees, in association with the serial scheduling generation scheme (Serial SGS), to execute the intelligent updating process of the swarms to search for better solutions. The performance of the proposed approach is analysed across various problem complexities associated with J30, J60 and J120 full instance sets of PSPLIB and compared with other approaches from the literature. Simulation results demonstrate that the proposed PBA provides an effective and efficient approach for solving RCPSP.

Suggested Citation

  • Mohamed Amine Nemmich & Fatima Debbat & Mohamed Slimane, 2019. "A Permutation-Based Bees Algorithm for Solving Resource-Constrained Project Scheduling Problem," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 10(4), pages 1-24, October.
    • Handle: RePEc:igg:jsir00:v:10:y:2019:i:4:p:1-24
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2019100101
    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:jsir00:v:10:y:2019:i:4:p:1-24. 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.