Ugrás a tartalomhoz

 

A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows

  • Metaadatok
Tartalom: http://real.mtak.hu/66906/
Archívum: MTA Könyvtár
Gyűjtemény: Status = Published

Type = Article
Cím:
A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows
Létrehozó:
LĂĄng, Blanka
Kiadó:
AkadĂŠmiai KiadĂł
Dátum:
2010
info:eu-repo/date/embargoEnd/2030-12-31
Téma:
TA Engineering (General). Civil engineering (General) / ĂĄltalĂĄnos mĂŠrnĂśki tudomĂĄnyok
Tartalmi leírás:
In this paper computational results are presented in order to illustrate the efficiency and robustness of the hybrid meta-heuristic algorithm that was presented previously. These results refer to only a ‘hard’ subset of the J30 subset from the well-known PSPLIB. In this subset there are instances for a feasible solution that can be got within 900-second time limit, but optimal solution cannot be found within this time limit. The efficiency and the solution time of two algorithms were compared: the present hybrid algorithm and an other approach, a state-of-the-art MPL system with callable MILP solver (CPLEX 8.1). The obtained computational results confirmed the expectations the hybrid algorithm is a robust and fast approach for the resource-constrained project-scheduling problem with discounted cash flows.
Nyelv:
magyar
Típus:
Article
PeerReviewed
info:eu-repo/semantics/article
Formátum:
text
Azonosító:
LĂĄng, Blanka (2010) A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows. Pollack Periodica, 5 (3). pp. 167-174. ISSN 1788-1994
Kapcsolat:
https://doi.org/10.1556/Pollack.5.2010.3.14
Létrehozó:
info:eu-repo/semantics/embargoedAccess