Sharif Digital Repository

A lot of projects in real life are subject to some kinds of nonrenewable resources that are not exactly similar to the type defined in the project scheduling literature. The difference stems from the fact that, in those projects, contrary to the common assumption in the project scheduling literature, nonrenewable resources are not available in full amount at the beginning of the project, but they are procured along the project horizon. In this paper, we study this different type of nonrenewable resources. To that end, we extend the resource constrained project scheduling problem (RCPSP) by this resource type (RCPSP-NR) and customize four basic branch and bound algorithms of RCPSP for it,... 

Renewable and nonrenewable resources are the most studied resource types in the field of resource-constrained project scheduling problems, however cumulative resources are another type of resources, widespread in practical cases that have been theoretically studied much less than the two aforementioned types. So in the current paper we study resource-constrained project scheduling problem subject to cumulative resources (RCPSP-Cu), focusing on development of exact algorithms for the problem. We customize three resource-constrained project scheduling problem (RCPSP) branch and bound algorithms of extension alternatives, minimal delaying alternatives and minimal forbidden sets for RCPSP-Cu. We...