Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. A positive cash flow is associated with the completion of each activity. The objective is the maximization of the net present value of all cash flows. Local search metaheuristics: simulated annealing and tabu search are proposed to solve this problem. A comprehensive computational experiment is described, performed on a set of standard test problems constructed by the ProGen project generator, where the activities' cash flows are generated randomly with the uniform distribution. The metaheuristics are computationally compared with the random sampling method. The results are analyzed and discussed and some final remarks are included.
Słowa kluczowe
Rocznik
Tom
Strony
97--114
Opis fizyczny
Bibliogr. 61 poz.
Twórcy
autor
autor
autor
autor
- Poznań University of Technology, Institute of Computing Science, Piotrowo 3A, 60-965 Poznań, Poland
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPP1-0028-0093