Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

Algorithm 2

Pseudocode of modified initial upper bound determination for RCPSP-NR.

(i)    Determine SIUB

(ii)   LST_𝑛+1=LFT_𝑛+1=SIUB

(iii) Determine LST and LFT of the activities using backward pass

(iv)  Compute LSTLFT of each activity and generate AL by prioritizing the activities in non-decreasing order of their LSTLFTs;

   If tie happens, prioritize the activities related to the tie in increasing order of their index numbers

(v)    Schedule activities in their related order of the AL in the earliest precedence and resource feasible times

(vi)  Report the finish time of last project activity as modified initial upper bound