Title of article :
Integrated bi-objective project selection and scheduling using Bayesian networks: A risk-based approach
Author/Authors :
Namazian, A. Department of Industrial Engineering - College of Engineering - University of Tehran, Tehran, Iran , Haji Yakhchali, S. Department of Industrial Engineering - College of Engineering - University of Tehran, Tehran, Iran , Rabbani, M. Department of Industrial Engineering - College of Engineering - University of Tehran, Tehran, Iran
Abstract :
This paper presents a novel formulation for the integrated bi-objective
problem of project selection and scheduling. The rst objective was to minimize the
aggregated risk by evaluating the expected value of schedule delay and the second objective
was to maximize the achieved benet. To evaluate the expected aggregated impacts of
risks, an objective function based on the Bayesian Networks was proposed. In the extant
mathematical models of the joint problem of project selection and scheduling, projects
are selected and scheduled without considering the risk network of the projects indicating
the individual and interaction eects of risks impressing the duration of the activities. To
solve the model, two solution approaches were developed, one exact and one metaheuristic
approach. Goal Programming (GP) method was adopted to optimally select and schedule
projects. Since the problem was NP-hard (Non-deterministic Polynomial-time), an
algorithm combining GP method and Genetic Algorithm (GA) was proposed, hence
named GPGA. Finally, the eciency of the proposed algorithm was assessed not only
based on small-size instances, but also by generating and testing representative datasets
of larger instances. The results of the computational experiments indicated that it had
acceptable performance in handling large-size and more realistic problems.
Keywords :
Project selection and scheduling , Risk analysis , Bayesian networks , Multi-objective programming , Genetic algorithm
Journal title :
Scientia Iranica(Transactions E: Industrial Engineering)