A two-stage genetic programming framework for Stochastic Resource Constrained Multi-Project Scheduling Problem under New Project Insertions

被引:6
作者
Chen, HaoJie [1 ]
Zhang, Jian [1 ]
Li, Rong [1 ]
Ding, Guofu [1 ]
Qin, Shengfeng [2 ]
机构
[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
关键词
Multi-state combination scheduling; Genetic programming; Hyper-heuristic; Priority rule; Stochastic resource constrained; multi-project scheduling; PRIORITY RULES; HYPER-HEURISTICS; OPTIMIZATION; DURATIONS; ALGORITHM;
D O I
10.1016/j.asoc.2022.109087
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study proposes a novel hyper-heuristic based two-stage genetic programming framework (HHTGP) to solve the Stochastic Resource Constrained Multi-Project Scheduling Problem under New Project Insertions (SRCMPSP-NPI). It divides the evolution of genetic programming into generation and selection stages, and then establishes a multi-state combination scheduling mode with multiple priority rules (PRs) for the first time to realize resource constrained project scheduling under both stochastic activity duration and new project insertion. In the generation stage, based on a modified attribute set for multi-project scheduling, NSGA-II is hybridized to evolve a non-dominated PR set for forming a selectable PR set. While in the selection stage, the whole decision-making process is divided into multiple states based on the completion activity duration, and a weighted normalized evolution process with two crossovers, two mutations and four local search operators to match the optimal PR for each state from the PR set. Under the existing benchmark, HH-TGP is compared with the existing methods to verify its effectiveness. Crown Copyright (c) 2022 Published by Elsevier B.V. All rights reserved.
引用
收藏
页数:21
相关论文
共 58 条
  • [1] A New Priority Rule for Solving Project Scheduling Problems
    Adamu, Patience I.
    Okagbue, Hilary I.
    Oguntunde, Pelumi E.
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2019, 106 (02) : 681 - 699
  • [2] Solving the FS-RCPSP with hyper-heuristics: A policy-driven approach
    Alipouri, Yagub
    Sebt, Mohammad Hassan
    Ardeshir, Abdollah
    Chan, Weng Tat
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (03) : 403 - 419
  • [3] A mixed-integer linear programming model for solving fuzzy stochastic resource constrained project scheduling problem
    Alipouri, Yagub
    Sebt, Mohammad Hassan
    Ardeshir, Abdollah
    Zarandi, Mohammad Hossein Fazel
    [J]. OPERATIONAL RESEARCH, 2020, 20 (01) : 197 - 217
  • [4] Resource-Constrained Critical Path Scheduling by a GRASP-Based Hyperheuristic
    Anagnostopoulos, Konstantinos
    Koulinas, Georgios
    [J]. JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2012, 26 (02) : 204 - 213
  • [5] [Anonymous], 2001, THESIS TU BERLIN
  • [6] New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing
    Ashtiani, Behzad
    Leus, Roel
    Aryanezhad, Mir-Bahador
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (02) : 157 - 171
  • [7] Resource-Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations
    Ballestin, Francisco
    Leus, Roel
    [J]. PRODUCTION AND OPERATIONS MANAGEMENT, 2009, 18 (04) : 459 - 474
  • [8] SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY
    BLAZEWICZ, J
    LENSTRA, JK
    KAN, AHGR
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 11 - 24
  • [9] Automated Design of Production Scheduling Heuristics: A Review
    Branke, Juergen
    Su Nguyen
    Pickardt, Christoph W.
    Zhang, Mengjie
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (01) : 110 - 124
  • [10] Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems
    Brcic, Mario
    Katic, Marija
    Hlupic, Nikica
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 58 - 66