A PARALLEL SIMULATED ANNEALING (PSA) FOR SOLVING PROJECT SCHEDULING PROBLEM WITH DISCOUNTED CASH FLOW POLICY IN PRICING STRATEGY OF THE PROJECT SUPPLIERS

被引:3
作者
Nasab, Seyed Mohammad Tabataba'i [1 ]
Kaveh, Mojtaba [2 ]
机构
[1] Yazd Univ, Dept Business Adm, Fac Econ Management & Accounting, Yazd, Iran
[2] Islamic Azad Univ, Firoozabad Branch, Dept Business Adm, Firoozabad, Iran
来源
TEHNICKI VJESNIK-TECHNICAL GAZETTE | 2016年 / 23卷 / 06期
关键词
discount; discounted cash flow; parallel simulated annealing algorithm; pricing; project scheduling; RESOURCE CONSTRAINTS; ALGORITHM; HEURISTICS;
D O I
10.17559/TV-20140425121514
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Resource-constrained project scheduling problem is known as a NP-Hard problem in literature. In this research, discounted cash flow policy is suggested for the resources-constrained project scheduling problem for the first time while in classic models, it has been assumed that price of the required resources is fixed for performing the activities and resources can be prepared only with one price rate in the market. Goal of this problem is to determine optimal starting time of the project activities considering precedence constraints and the available resources such that the project completion time can be minimized. In order to solve the proposed model, a hybrid algorithm based on two algorithms i.e. genetic and simulated annealing has been suggested. In this method, genetic algorithm has been designed as the main framework of the proposed method and simulated annealing method as a new operator and in order to improve local search of the main algorithm. Since values of the parameters have considerable effect on efficiency of these algorithms, therefore, a new statistical approach based on the stepwise regression has been presented to set the proposed algorithms parameters. Results of the calculations show high efficiency of proposed algorithm in terms of solution time and optimal solutions.
引用
收藏
页码:1555 / 1563
页数:9
相关论文
共 29 条
[1]   Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms [J].
Alcaraz, J ;
Maroto, C ;
Ruiz, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) :614-626
[2]   A variable neighbourhood search algorithm for the flexible job-shop scheduling problem [J].
Amiri, M. ;
Zandieh, M. ;
Yazdani, M. ;
Bagheri, A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (19) :5671-5689
[3]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[4]   Resource-constrained project scheduling by simulated annealing [J].
Boctor, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (08) :2335-2351
[5]   HEURISTICS FOR SCHEDULING PROJECTS WITH RESOURCE RESTRICTIONS AND SEVERAL RESOURCE-DURATION MODES [J].
BOCTOR, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (11) :2547-2558
[6]   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
[7]   A branch and bound algorithm for the resource-constrained project scheduling problem [J].
Brucker, P ;
Knust, S ;
Schoo, A ;
Thiele, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) :272-288
[8]   Lower bounds for resource-constrained project scheduling problems [J].
Brucker, P ;
Knust, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :302-313
[9]   Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem [J].
Demassey, S ;
Artigues, C ;
Michelon, P .
INFORMS JOURNAL ON COMPUTING, 2005, 17 (01) :52-65
[10]   New benchmark results for the resource - Constrained project scheduling problem [J].
Demeulemeester, EL ;
Herroelen, WS .
MANAGEMENT SCIENCE, 1997, 43 (11) :1485-1492