Scenario-based evolutionary approach for robust RCPSP

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The present paper deals with the resource-constrained project scheduling problem with uncertain activity durations. Based on scenarios, we investigate two robust models, the min-max model which focuses on the minimization of the absolute robustness objective and the min-max regret model having the object to minimize the absolute regret. We propose an adaptive robust genetic approach with a sophisticated initial population and a Forward-Backward Improvement heuristic. The proposed algorithm is applied for the PSPLIB J30 data set with modified activity durations. Obtained results show the performance of the genetic algorithm combined with the improvement heuristic compared with the basic version. Different perturbation levels were tested to determine the corresponding performance degradation.

Cite

CITATION STYLE

APA

Mogaadi, H., & Chaar, B. F. (2016). Scenario-based evolutionary approach for robust RCPSP. In Advances in Intelligent Systems and Computing (Vol. 427, pp. 45–55). Springer Verlag. https://doi.org/10.1007/978-3-319-29504-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free