.png){kind=icon}
.png){kind=icon}
Return
A filtering genetic programming framework for stochastic resource constrained multi-project scheduling problem under new project insertions
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2022.116911.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-project management and uncertain environment are very common factors, and they bring greater challenges to scheduling due to the increase of problem complexity and response efficiency requirements. In this paper, a novel hyper-heuristic based filtering genetic programming (HH-FGP) framework is proposed for evolving priority rules (PRs) to deal with a multi-project scheduling problem considering stochastic activity duration and new project insertion together, namely the Stochastic Resource Constrained Multi-Project Scheduling Problem under New Project Insertions (SRCMPSP-NPI), within heuristic computation time. HH-FGP is designed to divide traditional evolution into sampling and filtering evolution for simultaneously filtering two kinds of parameters constituting PRs, namely depth range and attribute, to obtain more effective PRs. Based on this, the existing genetic search and local search are improved to meet the depth constraints, and a multiobjective evaluation mechanism is designed to achieve effective filtering. Under the existing benchmark, HHFGP is compared and analysed with the existing methods to verify its effectiveness.
Keywords:
Filtering evolution
Genetic programming
Priority rule
Stochastic resource constrained multi-project
scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W