A comparison of two heuristics for building initial schedule for resource-constrained project scheduling problem
This paper considers two algorithms for well known resource-constrained project scheduling problem (RCPSP). Feasible schedule is constructed using randomized best insertion algorithm and examining best insertion algorithm. First we randomly choose m activities, optimally solve this partial schedule and then insert the remaining activities in this partial schedule in consecutive order. Experimental work shows very good results on standard test instances found in PSPLIB.