Journal of Applied Sciences1812-56541812-5662orgz10.3923/jas.2008.3917.3923RabbaniM.BaradaranS.GhomiS.M.T. FatemiHasheminS.S.122008821This study presents a constructive heuristic for constrained
resource allocation in PERT type networks. The problem consists in scheduling
a project, i.e., a set of activities (or tasks) linked by precedence constraints
should be scheduled subject to resource constraints while minimizing the
total duration of the project (the so called makespan). The assumption
is made that the constrained resource is renewable for allocation to the
activities of project. The activities durations are independent continuous
random variables, preemption is not allowed and renewable resource requirements
are constant throughout the duration of an activity. Project scheduling
problems of this type belong to the class of NP-hard optimization problems.
So, to solve this type of problems, heuristic procedures should be used.
We developed a new constructive heuristic rule ((T and R)_{CI})
and evaluated through design of experiments. The experiments show the
efficiency of new rule and it performed well, compared to well-known criterion
of minimum slack time.]]>Alvarez-Valdes, R., E. Crespo, J.M. Tamarit and F. Villa, 2006Blazewicz, J., J.K. Lenstra and A.H.G.R. Kan,1983Bouleimen, K. and H. Lecocq, 2003Brucker, P., A. Drexl, R. Mohring, K. Neumann and E. Pesch,1999Demeulemeester, E. and W. Herroelen,2002Herroelen, W., E. Demeulemeester and B. De Reyck, 1998Herroelen, W. and R. Leus,2005Kolisch, R. and S. Hartmann,1998Kolisch, R. and S. Hartmann,2006Kolisch, R. and R. Padman,2001Kurtulus, I. and W. Davis,1982Liess, O. and P. Michelon, 2008Maroto, C., P. Tormos and A. Lova,1998Mika, M., G. Waligóra and J. Weglarz,2005Moder, J.J., C.R. Phillips and E.W. Davis, 1983Soroush, H.M.,1994Sprecher, A., R. Kolisch and A. Drexl,1995