Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A discrete artificial bee colony algorithm for resource-constrained project scheduling problem

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nouri, N. ; Lab. ROI, Ecole Poly Tech. de Tunisie, La Marsa, Tunisia ; Krichen, S. ; Ladhari, T. ; Fatimah, P.

In this paper, we present a new meta-heuristic based on the performance of the artificial bee colony (ABC) for solving the resource-constrained project scheduling problem (RCPSP). The proposed algorithm iteratively solves the RCPSP by utilizing different types of honey bees on three main steps: initialization, update, and termination. The initial population is obtained through randomization and with respect to precedence constraints. Serial schedule generation scheme is applied to generate a feasible solution. Adaptive mechanism and local search approach, based on discrete insert and swap operators, are used for neighborhood search. The performance of the newly method is compared against a set of state-of-art algorithms. Simulation results demonstrate that the algorithm provides an efficient approach for solving RCPSP.

Published in:

Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on

Date of Conference:

28-30 April 2013