Modified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations

Authors

  • Vahid Bardaran Department of Industrial Engineering, Islamic Azad University, Tehran North Branch, Tehran, Iran.
Abstract:

In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworking risks of activities, and costs of processing the activities, simultaneously. A modified version of the Pareto Archived Evolution Strategy (MV-PAES) is developed to solve the problem. Contrary to the basic PAES, this algorithm operates based on a population of solutions. For the proposed method, we devised crossover and mutation operators, which strengthen this algorithm in exploring solution space. Comprehensive numerical tests have been conducted to evaluate the performance of the MV-PAES in comparison with two other meta-heuristics. The outputs show the excellence of the MV-PAES in comparison with other methods. A real-world software development project has been studied to demonstrate the practicality of the proposed model for real-world environment. The influence of competency evolution has been investigated in this case study. The results imply that the competency evolution has a considerable impact on the objective function values.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect

This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance.  First the problem is encoded with a...

full text

A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations

In this paper we propose a new lower bound for the resource constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational results are presented and confirmed a better ...

full text

Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations

This study addresses the resource-constrained project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the activities. To solve the problem, five multi-objective metaheuristic algorithms are analyzed, based on Multi-objective GRASP (MOG), Multiobjective Variable Neighborhood Search (MOVNS) and Pareto Iterated Lo...

full text

A Reactive Approach for the Multi-Skill Project Scheduling Problem

This paper deals with the Multi-Skill Project Scheduling Problem (MSPSP) in case of disruptions. First, the problem is defined, then a way to build a first schedule is introduced and finally the reactive approach used to repare the schedule is presented.

full text

The Pareto Archived Evolution

We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible non-trivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its simplest form, is a (1 + 1) evolution strategy, employing local search but using a reference arc...

full text

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 1

pages  59- 86

publication date 2020-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023