@article{(Open Science Index):https://publications.waset.org/pdf/5335,
	  title     = {A Branch and Bound Algorithm for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources},
	  author    = {A. Shirzadeh Chaleshtari and  Sh. Shadrokh},
	  country	= {},
	  institution	= {},
	  abstract     = {Renewable and non-renewable resource constraints have been vast studied in theoretical fields of project scheduling problems. However, although cumulative resources are widespread in practical cases, the literature on project scheduling problems subject to these resources is scant. So in order to study this type of resources more, in this paper we use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities and subject to the cumulative resources in addition to the renewable resources. We develop a branch and bound algorithm for this problem customizing precedence tree algorithm of RCPSP. We perform extensive experimental analysis on the algorithm to check its effectiveness and performance for solving different instances of the problem in question.
},
	    journal   = {International Journal of Industrial and Manufacturing Engineering},
	  volume    = {6},
	  number    = {2},
	  year      = {2012},
	  pages     = {376 - 381},
	  ee        = {https://publications.waset.org/pdf/5335},
	  url   	= {https://publications.waset.org/vol/62},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 62, 2012},
	}