A hyper-heuristic based ensemble genetic programming approach for stochastic resource constrained project scheduling problem

被引:43
作者
Chen, HaoJie [1 ]
Ding, Guofu [1 ]
Qin, Shengfeng [2 ]
Zhang, Jian [1 ]
机构
[1] Southwest Jiaotong Univ, Sch Mech Engn, Chengdu 610031, Peoples R China
[2] Northumbria Univ, Dept Design, Newcastle Upon Tyne NE1 8ST, Tyne & Wear, England
关键词
Ensemble decision; Genetic programming; Hyper-heuristics; Priority rule; Stochastic resource constrained project scheduling; PRIORITY RULES; ALGORITHM; OPTIMIZATION; MAKESPAN; DRIVEN;
D O I
10.1016/j.eswa.2020.114174
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In project scheduling studies, to the best of our knowledge, the hyper-heuristic collaborative scheduling is first-time applied to project scheduling with random activity durations. A hyper-heuristic based ensemble genetic programming (HH-EGP) method is proposed for solving stochastic resource constrained project scheduling problem (SRCPSP) by evolving an ensemble of priority rules (PRs). The proposed approach features with (1) integrating the critical path method into the resource-based policy class to generate schedules; (2) improving the existing single hyper-heuristic project scheduling research to construct a suitable solution space for solving SRCPSP; and (3) bettering genetic evolution of each subpopulation from a decision ensemble with three different local searches in corporation with discriminant mutation and discriminant population renewal. In addition, a sequence voting mechanism is designed to deal with collaborative decision-making in the scheduling process for SRCPSP. The benchmark PSPLIB is performed to verify the advantage of the HH-EGP over heuristics, meta-heuristics and the single hyper-heuristic approaches.
引用
收藏
页数:15
相关论文
共 54 条
[1]   Resource-Constrained Critical Path Scheduling by a GRASP-Based Hyperheuristic [J].
Anagnostopoulos, Konstantinos ;
Koulinas, Georgios .
JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2012, 26 (02) :204-213
[2]  
[Anonymous], 2001, P 3 ANN C GENETIC EV
[3]   An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem [J].
Arkhipov, Dmitry ;
Battaia, Olga ;
Lazarev, Alexander .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (01) :35-44
[4]   New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing [J].
Ashtiani, Behzad ;
Leus, Roel ;
Aryanezhad, Mir-Bahador .
JOURNAL OF SCHEDULING, 2011, 14 (02) :157-171
[5]   When it is worthwhile to work with the stochastic RCPSP? [J].
Ballestin, Francisco .
JOURNAL OF SCHEDULING, 2007, 10 (03) :153-166
[6]   Resource-Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations [J].
Ballestin, Francisco ;
Leus, Roel .
PRODUCTION AND OPERATIONS MANAGEMENT, 2009, 18 (04) :459-474
[7]   Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling [J].
Bettemir, Onder Halis ;
Sonmez, Rifat .
JOURNAL OF MANAGEMENT IN ENGINEERING, 2015, 31 (05)
[8]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[9]   Resource-constrained project scheduling by simulated annealing [J].
Boctor, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (08) :2335-2351
[10]   Resource-constrained multi-project scheduling: Priority rule performance revisited [J].
Browning, Tyson R. ;
Yassine, Ali A. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 126 (02) :212-228