A heuristic rule adaptive selection approach for multi-work package project scheduling problem

Abstract

<p> <span>Effectively scheduling a project is crucial for its success, especially after generating work packages from the work breakdown structure during the planning phase. Nevertheless, solving project scheduling problems with multiple work packages is challenging due to the inefficient utilization of work package information in existing scheduling approaches. To address this issue, this paper proposes the Heuristic Rule Adaptive Selection (HAS) approach for the Multi-Work Package Project Scheduling Problem (MWPSP). This approach involves work package information and employs reinforcement learning (RL) for intelligent decision-making in scheduling. First, the MWPSP with the optimization objective of minimizing the Portfolio Delay (PDEL) and the Average Percent Delay (APD) is defined, and a scheduling environment is established that integrates information from both work packages and tasks. Second, a Double Deep Q-network (DDQN) is employed to train agents for adaptively selecting heuristic rules of tasks and work packages. The performance of the HAS approach is then evaluated using a case project and the newly created MWPSP dataset. The experimental results demonstrate that the HAS approach exhibits superior solution quality and computational efficiency in optimizing PDEL and APD compared to heuristics approaches, e.g., single-priority rule-based heuristics and genetic algorithms. This achievement sets the stage for the development of next-generation adaptive scheduling for construction projects.</span> <br></p>