A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line

Abstract

Motivated by the resource transfer time between different stations in the aircraft moving assembly line, this study addresses the resource-constrained project scheduling problem with resource transfer time, which aims at minimizing the makespan of the project while respecting precedence relations and resource constraints. We assume that the resource transfer time is known and deterministic in advance. The resource transfer time and the precedence of activities are coupled with each other, which means that the transfer time of resource changes according to the precedence of activities, while the transfer time affects the decision of the precedence of activities at the same time. We present a linear mathematical model for the problem and propose a branch-and-bound embedded genetic algorithm with a new precedence-based coding method which adapts to the structure of the problem. A series of experimental tests reveal that the branch-and-bound embedded genetic algorithm outperforms the existing algorithm proposed in the literature in finding high quality solutions.