Best insertion algorithm for resource-constrained project scheduling problem

Details Best insertion algorithm for resource-constrained project scheduling problem Best insertion algorithm for resource-constrained project scheduling problem

2007-05-15

arxiv.org/abs/0705.2137v1

Computer Science

Discrete Mathematics

8 pages, submitted to conference KOI 2006

Scientific paper

This paper considers heuristics for well known resource-constrained project scheduling problem (RCPSP). First a feasible schedule is constructed using randomized best insertion algorithm. The construction is followed by a local search where a new solution is generated as follows: first we randomly delete m activities from the list, which are then reinserted in the list in consecutive order. At the end of run, the schedule with the minimum makespan is selected. Experimental work shows very good results on standard test instances found in PSPLIB

Affiliated with

Also associated with

No associations

Rating

Best insertion algorithm for resource-constrained project scheduling problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Best insertion algorithm for resource-constrained project scheduling problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Best insertion algorithm for resource-constrained project scheduling problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623106