To read this content please select one of the options below:

Resource-constrained repetitive project scheduling with soft logic

Xin Zou (Department of Economic Management, North China Electric Power University, Beijing, China)
Zhuang Rong (North China Electric Power University - Baoding Campus, Baoding, China)

Engineering, Construction and Architectural Management

ISSN: 0969-9988

Article publication date: 2 January 2024

108

Abstract

Purpose

In repetitive projects, repetition offers more possibilities for activity scheduling at the sub-activity level. However, existing resource-constrained repetitive scheduling problem (RCRSP) models assume that there is only one sequence in performing the sub-activities of each activity, resulting in an inefficient resource allocation. This paper proposes a novel repetitive scheduling model for solving RCRSP with soft logic.

Design/methodology/approach

In this paper, a constraint programming model is developed to solve the RCRSP using soft logic, aiming at the possible relationship between parallel execution, orderly execution or partial parallel and partial orderly execution of different sub activities of the same activity in repetitive projects. The proposed model integrated crew assignment strategies and allowed continuous or fragmented execution.

Findings

When solving RCRSP, it is necessary to take soft logic into account. If managers only consider the fixed logic between sub-activities, they are likely to develop a delayed schedule. The practicality and effectiveness of the model were verified by a housing project based on eight different scenarios. The results showed that the constraint programming model outperformed its equivalent mathematical model in terms of solving speed and solution quality.

Originality/value

Available studies assume a fixed logic between sub-activities of the same activity in repetitive projects. However, there is no fixed construction sequence between sub-activities for some projects, e.g. hotel renovation projects. Therefore, this paper considers the soft logic relationship between sub-activities and investigates how to make the objective optimal without violating the resource availability constraint.

Keywords

Acknowledgements

This work was supported by the National Natural Science Foundation of China (grant numbers 72171081 and 71701069), the Fundamental Research Funds for the Central Universities (grant number 2023MS153) and the Natural Science Foundation of Hebei Province (G2022502001). The authors are also grateful to the anonymous reviewer and editor for careful scrutiny of the details and for comments that helped improve this manuscript.

Since submission of this article, the following author(s) have updated their affiliation(s): Zhuang Rong is at State Grid Qingdao Power Supply Company, Qingdao City, China.

Corrigendum: It has come to the attention of the publisher that the authors of the article Zou, X. and Rong, Z. (2024), “Resource-constrained repetitive project scheduling with soft logic”, Engineering, Construction and Architectural Management, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/ECAM-08-2022-0703 included the following incorrect funding information: This work was supported by the National Natural Science Foundation of China (grant numbers 72171081 and 71701069) and the Fundamental Research Funds for the Central Universities (grant number 2020MS129). The correct funding information is as follows: This work was supported by the National Natural Science Foundation of China (grant numbers 72171081 and 71701069), the Fundamental Research Funds for the Central Universities (grant number 2023MS153) and the Natural Science Foundation of Hebei Province (G2022502001). The authors sincerely apologise for this error.

Citation

Zou, X. and Rong, Z. (2024), "Resource-constrained repetitive project scheduling with soft logic", Engineering, Construction and Architectural Management, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/ECAM-08-2022-0703

Publisher

:

Emerald Publishing Limited

Copyright © 2023, Emerald Publishing Limited

Related articles