PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A comparison of two heuristics for building initial schedule for resource-constrained project scheduling problem
Igor Pesek and Janez Žerovnik
In: 3rd International Conference of Logistics & Sustainable Transport 2006, 26 Oct 2006, Celje, Slovenija.


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.

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