Time-cost trade-offs in resource-constraint project scheduling problems with overlapping modes

Abstract

In companies, overlapping is commonly regarded as a promising strategy to accelerate project execution. Overlapping consists in executing in parallel two sequential activities by allowing a downstream activity to start before the end of an upstream activity based on preliminary information. However, overlapping can entail reworks in downstream activity, caused by information updates until finalised information is available, and additional coordination and communication, which both require additional time and costs. In this paper, we present a model for the resource-constrained project scheduling problem with feasible overlapping modes. The makespan minimisation and the gain maximisation problems are formulated as linear integer programmes. Time-cost tradeoffs between project duration and overlapping costs are also discussed. An example of a 30-activity project is provided to illustrate the utility and efficiency of the model. Our results highlight the closed interaction between resource constraints and overlapping modes and suggest the relevance of jointly considering them.

Resource-constrained project scheduling problem: review of past and recent developments

“…Berthaut et al (2014) followed the time-cost tradeoff problem by considering the acceleration of performing the project through overlapping of sequential activities and costs caused by parallel performing of these activities. Choi and Park (2015) defined several stages in project such a way that the tardiness in each stage was associated with penalty cost.…”

Optimization of overlapping activities in the design phase of construction projects

“…The most recent research, with similarities to the research by Roemer and Ahamadi [8] and Gerk and Qassim [18], is conducted by Berthaut et al [19,20]. This research investigated the different feasible modes of overlapping, taking resource constraints into account.…”

Developing Shuffled Frog‐Leaping Algorithm (SFLA) Method to Solve Power Load‐Constrained TCRTO Problems in Civil Engineering

“…(2) Integer programming (IP) and linear programming (LP): IP, LP, and hybrid IP/LP are analytical algorithms that have been commonly used to solve construction scheduling optimization problems due to their innate efficiency and accuracy [25,26]. In most cases, IP or LP approaches focus on a single target.…”