A greedy heuristic approach for the Resource-Constrained Project Scheduling Problem Full article
| Journal |
Studia Informatica Universalis
ISSN: 1625-7545 |
||
|---|---|---|---|
| Output data | Year: 2012, Volume: 9, Number: 3, Pages: 79-90 Pages count : 9 | ||
| Tags | resource constrained project scheduling problem, renewable resources, greedy heuristic | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
We consider the resource constrained project scheduling problem (RCPSP) with
precedence. All resources are renewable and the objective is to find a schedule that meets all resource and precedence constraints and minimizes the makespan. We propose a heuristic deterministic greedy algorithm solving this problem with the time complexity depending on the number of activities as nlogn. The main idea of the algorithm is to use a solution of a relaxed problem, with all constrained resources being accumulative. Quality of this algorithm has been analyzed in a number of computational experiments using the standard sets j30, j60, and jl20 for the RCPSP from the PSPLIB[RA96].
Cite:
Goncharov E.
A greedy heuristic approach for the Resource-Constrained Project Scheduling Problem
Studia Informatica Universalis. 2012. V.9. N3. P.79-90.
A greedy heuristic approach for the Resource-Constrained Project Scheduling Problem
Studia Informatica Universalis. 2012. V.9. N3. P.79-90.
Identifiers:
No identifiers
Citing:
Пока нет цитирований