PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Best insertion algorithm for resource constrained project scheduling problem
Igor Pesek and Janez Žerovnik
In: 11th International Conference on Operational Research KOI 2006, 27 – 29 September 2006, Pula, Croatia.


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.

EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:2444
Deposited By:Igor Pesek
Deposited On:22 November 2006