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

被引:25
作者
Afshar-Nadjafi, Behrouz [1 ]
机构
[1] Islamic Azad Univ, Fac Ind & Mech Engn, Qazvin Branch, Qazvin, Iran
关键词
Project scheduling; Multi-mode; Investment; Simulated annealing; SIMULATED ANNEALING ALGORITHM; PROJECT SCHEDULING PROBLEMS; GENETIC ALGORITHM; TABU SEARCH; OPTIMIZATION; CONSTRAINTS; SUBJECT;
D O I
10.1016/j.apm.2014.04.009
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:5347 / 5355
页数:9
相关论文
共 44 条
[1]   Bi-objective resource-constrained project scheduling with robustness and makespan criteria [J].
Abbasi, Babak ;
Shadrokh, Shahram ;
Arkat, Jamal .
APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (01) :146-152
[2]   A multi-mode resource-constrained discrete time-cost tradeoff problem solving using an adjusted fuzzy dominance genetic algorithm [J].
Afruzi, E. Nabipoor ;
Roghanian, E. ;
Najafi, A. A. ;
Mazinani, M. .
SCIENTIA IRANICA, 2013, 20 (03) :931-944
[3]  
Afshar-Nadjafi B., J KING SAUD IN PRESS
[4]   A genetic algorithm for mode identity and the resource constrained project scheduling problem [J].
Afshar-Nadjafi, Behrouz ;
Rahimi, Amir ;
Karimi, Hamid .
SCIENTIA IRANICA, 2013, 20 (03) :824-831
[5]   A Neurogenetic approach for the resource-constrained project scheduling problem [J].
Agarwal, Anurag ;
Colak, Selcuk ;
Erenguc, Selcuk .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :44-50
[6]   A double genetic algorithm for the MRCPSP/max [J].
Barrios, Agustin ;
Ballestin, Francisco ;
Valls, Vicente .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :33-43
[7]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[8]   A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version [J].
Bouleimen, K ;
Lecocq, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :268-281
[9]   Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers [J].
Coelho, Jose ;
Vanhoucke, Mario .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (01) :73-82
[10]   Minimizing resource availability costs in time-limited project networks [J].
Demeulemeester, E .
MANAGEMENT SCIENCE, 1995, 41 (10) :1590-1598