An Improved PSO Algorithm for Resource-Constrained Project Scheduling Problem

Author(s):  
Xinggang Luo ◽  
Dingwei Wang ◽  
Jiafu Tang ◽  
Yiliu Tu
Author(s):  
Dang Quoc Huu

The Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP) is a combinational optimization problem with many applications in science and practical areas. This problem aims to find out the feasible schedule for the completion of projects and workflows that is minimal duration or cost (or both of them - multi objectives). The researches show that MS-RCPSP is classified into NP-Hard classification, which could not get the optimal solution in polynomial time. Therefore, we usually use approximate methods to carry out the feasible schedule. There are many publication results for that problem based on evolutionary methods such as GA, Greedy, Ant, etc. However, the evolutionary algorithms usually have a limitation that is fallen into local extremes after a number of generations. This paper will study a new method to solve the MS-RCPSP problem based on the Particle Swarm Optimization (PSO) algorithm that is called R-PSO. The new improvement of R-PSO is re-assigning the resource to execute solution tasks. To evaluate the new algorithm's effectiveness, the paper conducts experiments on iMOPSE datasets. Experimental results on simulated data show that the proposed algorithm finds a better schedule than related works.


2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Mohammad Khalilzadeh ◽  
Fereydoon Kianfar ◽  
Ali Shirzadeh Chaleshtari ◽  
Shahram Shadrokh ◽  
Mohammad Ranjbar

We introduce a multimode resource-constrained project scheduling problem with finish-to-start precedence relations among project activities, considering renewable and nonrenewable resource costs. We assume that renewable resources are rented and are not available in all periods of time of the project. In other words, there is a mandated ready date as well as a due date for each renewable resource type so that no resource is used before its ready date. However, the resources are permitted to be used after their due dates by paying penalty costs. The objective is to minimize the total costs of both renewable and nonrenewable resource usage. This problem is called multimode resource-constrained project scheduling problem with minimization of total weighted resource tardiness penalty cost (MRCPSP-TWRTPC), where, for each activity, both renewable and nonrenewable resource requirements depend on activity mode. For this problem, we present a metaheuristic algorithm based on a modified Particle Swarm Optimization (PSO) approach introduced by Tchomté and Gourgand which uses a modified rule for the displacement of particles. We present a prioritization rule for activities and several improvement and local search methods. Experimental results reveal the effectiveness and efficiency of the proposed algorithm for the problem in question.


Sign in / Sign up

Export Citation Format

Share Document