Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
