Work continuity constraints in repetitive project scheduling considering soft logic

Abstract

PurposeRepetitive projects play an important role in the construction industry. A crucial point in scheduling this type of project lies in enabling timely movement of crews from unit to unit so as to minimize the adverse effect of work interruptions on both time and cost. This paper aims to examine a repetitive scheduling problem with work continuity constraints, involving a tradeoff among project duration, work interruptions and total project cost (TPC). To enhance flexibility and practicability, multi-crew execution is considered and the logic relation between units is allowed to be changed arbitrarily. That is, soft logic is considered.Design/methodology/approachThis paper proposes a multi-objective mixed-integer linear programming model with the capability of yielding the optimal tradeoff among three conflicting objectives. An efficient version of the e-constraint algorithm is customized to solve the model. This model is validated based on two case studies involving a small-scale and a practical-scale project, and the influence of using soft logic on project duration and total cost is analyzed via computational experiments.FindingsUsing soft logic provides more flexibility in minimizing project duration, work interruptions and TPC, especial for non-typical projects with a high percentage of non-typical activities.Research limitations/implicationsThe main limitation of the proposed model fails to consider the learning-forgetting phenomenon, which provides space for future research.Practical implicationsThis study assists practitioners in determining the “most preferred” schedule once additional information is provided.Originality/valueThis paper presents a new soft logic-based mathematical programming model to schedule repetitive projects with the goal of optimizing three conflicting objectives simultaneously.