A Based-Bee Algorithm Approach for the Multi-Mode Project Scheduling Problem

Solving the resource constrained project scheduling problem (RCPSP) through exact and approximate approaches has an important role in real life to the extent that they support making decisions regards to the allocation of resources and activities scheduling. Accordingly, this work presents a Based-B...

Full description

Saved in:
Bibliographic Details
Published inProcedia manufacturing Vol. 39; pp. 1864 - 1871
Main Authors Niño, Karen, Peña, Jorge
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2019
Subjects
Bee Algorithm
Metaheuristics
Multi-mode project scheduling problem
Scheduling
Bee Algorithm
Multi-mode project scheduling problem
Scheduling
Metaheuristics
Online AccessGet full text
ISSN2351-9789
2351-9789
DOI10.1016/j.promfg.2020.01.252

Cover

More Information
Summary:Solving the resource constrained project scheduling problem (RCPSP) through exact and approximate approaches has an important role in real life to the extent that they support making decisions regards to the allocation of resources and activities scheduling. Accordingly, this work presents a Based-Bee algorithm for the RCPSP under multi-mode conditions in order to minimize the total completion time of the project. The complexity of this problem lies mainly in the various modes in which activities can be performed; each mode has variations on the activity duration and resources requirements. The algorithm uses random keys strategies to guarantee feasible solutions are always reached. The proposed approach is evaluated with benchmark instances from PSLIB and compared with the recent competitive algorithms reported in literature.
ISSN:2351-9789
2351-9789
DOI:10.1016/j.promfg.2020.01.252