Abstract
In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature.
Highlights
In executing an air traffic schedule, bad weather or emergencies might occur whereby to-be-executed activities in this schedule are no longer feasible
We investigated multiobjective dynamic resource-constrained project scheduling problems involving an increasing number of tasks
We presented an innovative Evolutionary Algorithm-based approach, called mapping of task ID for centroid-based adaptation with random immigrants (McBAR), and applied this to search for optimal schedules as solutions to the problems
Summary
In executing an air traffic schedule, bad weather or emergencies might occur whereby to-be-executed activities in this schedule are no longer feasible. Many real-world problems are set in this type of dynamic scenario where their objectives, constraints, or even dimensions may change in time [1,2,3]. This is true for some resource-constrained project scheduling (RCPS) problems, a class of problems that have ongoing tasks restricted to utilizing a limited number of resources [4]. In this figure, boxed numbers are IDs of tasks of an RCPS; directed links signify precedence relationships of these tasks; and labels “S” and “E” correspond
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
