In this paper, we study scheduling of R&D projects in which activities may to be failed due to the technological risks. We consider two introduced problems in the literature referred to as R&D Project Scheduling Problem (RDPSP) and Alternative Technologies Project Scheduling Problem (ATPSP). In the both problems, the goal is the maximization of the expected net present value of activities where activities are precedence related and each of them is accompanied with a cost, a duration and a probability of technical success. In RDPSP, a project payoff is obtained if all activities are succeeded while in ATPSP, if one of activities is implemented successfully, the project payoff is attained. We developed a solution representation for each of these problems and developed two population-based metaheuristics including scatter search algorithm and genetic algorithm as solution approaches. Computational experiments indicate scatter search outperforms genetic algorithm and also available exact solution algorithms.
Ranjbar, M., Validi, H., & Fakhimi, R. (2016). Population-based metaheuristics for R&D project scheduling problems under activity failure risk. Scientia Iranica, 23(1), 374-386. doi: 10.24200/sci.2016.3841
MLA
Mohammad Ranjbar; Hamidreza Validi; Ramin Fakhimi. "Population-based metaheuristics for R&D project scheduling problems under activity failure risk". Scientia Iranica, 23, 1, 2016, 374-386. doi: 10.24200/sci.2016.3841
HARVARD
Ranjbar, M., Validi, H., Fakhimi, R. (2016). 'Population-based metaheuristics for R&D project scheduling problems under activity failure risk', Scientia Iranica, 23(1), pp. 374-386. doi: 10.24200/sci.2016.3841
VANCOUVER
Ranjbar, M., Validi, H., Fakhimi, R. Population-based metaheuristics for R&D project scheduling problems under activity failure risk. Scientia Iranica, 2016; 23(1): 374-386. doi: 10.24200/sci.2016.3841
)