In this research a mathematical formulation is presented for project scheduling problem subject to non-renewable perishable resources where the objective is minimize the cost of ordering and maintenance of resources. We use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities and resources will be perished after a determined duration and must be procured. Resource procurement have ordering and purchasing costs and excess resources must be stored and have maintenance cost. There is a unique way to perform the activities and preemption is not allowed.
This work employs Genetics Algorithms to solve the problem...