Multi-mode resource availability cost problem with recruitment and release dates for resources

This paper investigates the multi-mode resource availability cost problem with recruitment and release dates for resources. This problem is a more realistic model and extended case of the resource availability cost problem. The project contains activities interrelated by finish–start precedence rela...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematical modelling Ročník 38; číslo 21-22; s. 5347 - 5355
Hlavní autor: Afshar-Nadjafi, Behrouz
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2014
Témata:
Algorithms
Availability
Experimentation
Investment
Mathematical models
Multi-mode
Project scheduling
Recruitment
Simulated annealing
Time lag
MSLK
RND
NPM
NPO
MTS
SA
EFT
GRPW
SPT
Simulated annealing
ACNT-L
GA
LFT
WS
MRACP-RR
Multi-mode
AON
MRCPSP
EST
ACNT-SA
CL
SSGS
AL
LST
RLFT
ARD
Project scheduling
RK
RACP
RCL
SGS
Investment
RCPSP
ISSN:0307-904X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper investigates the multi-mode resource availability cost problem with recruitment and release dates for resources. This problem is a more realistic model and extended case of the resource availability cost problem. The project contains activities interrelated by finish–start precedence relations with zero time lags, which require a set of renewable resources. First, a mixed integer programming formulation is proposed for the problem. Then, simulated annealing (SA) algorithm is proposed to obtain a satisfying solution for this NP-hard problem. The effectiveness of the proposed algorithm is demonstrated through comprehensive experimentation based on 300 test problems. The results are analyzed and discussed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0307-904X
DOI:10.1016/j.apm.2014.04.009