BibTeX
CSL-JSON
MLA
Harvard
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
arXiv
0705.2137v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links