Best insertion algorithm for resource-constrained project scheduling problem release_wpet4seq6bfy3lzqziu4kdox4e

by Igor Pesek, Janez Žerovnik

Released as a article .

2007  

Abstract

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
In text/plain format

Archived Files and Locations

application/pdf  94.5 kB
file_blyr3ozmmbgyfgptah5gmpqwxu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2007-05-15
Version   v1
Language   en ?
arXiv  0705.2137v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: fe4dee90-1b0f-4a2a-a7b6-e5724271a710
API URL: JSON