Minimizing total weighted late work and cost of resources’ usage in the resource-constrained project scheduling problem

One of the problems related to resource-constrained project scheduling problem is weighted late work criterion because maybe activities do not have the same importance. In this paper this problem is considered and the objective is to minimize both the total weighted late work and resources cost. linear integer programming has been proposed for this problem. To prove these possible differences between activities an example is calculated by GAMS and the result is shown.