Abstract
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.
Highlights
The resource-constrained project scheduling problem RCPSP is the scheduling of project activities subject to precedence relations as well as renewable resource constraints with the objective of minimizing the makespan of the project
In the multimode RCPSP MRCPSP, a set of Mathematical Problems in Engineering allowable modes can be defined for each activity which is characterized by a constant duration and associated resource requirements
As the cost of renting for each renewable resource is fixed, there is no need to incorporate it into the objective function and only tardiness penalty cost is considered for each renewable resource
Summary
The resource-constrained project scheduling problem RCPSP is the scheduling of project activities subject to precedence relations as well as renewable resource constraints with the objective of minimizing the makespan of the project. Ranjbar et al 2 studied this problem with single mode for each activity and availability of one unit for each type of renewable resource, without considering nonrenewable resources They called this problem resource-constrained project scheduling problem, minimization of total weighted resource tardiness penalty cost RCPSP-TWRTPC , which is an extended form of resource-constrained project scheduling problem RCPSP. The problem we have studied here is a generalization of the problem introduced by Ranjbar et al 2 with more realistic viewpoint of resource costs by considering both renewable and nonrenewable resources cost We call this problem multimode resource-constrained project scheduling problem, minimization of total weighted resource tardiness penalty cost MRCPSPTWRTPC.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
