Show Summary Details
More options …

# Open Engineering

### formerly Central European Journal of Engineering

Editor-in-Chief: Ritter, William

CiteScore 2017: 0.70

SCImago Journal Rank (SJR) 2017: 0.211
Source Normalized Impact per Paper (SNIP) 2017: 0.787

ICV 2017: 100.00

Open Access
Online
ISSN
2391-5439
See all formats and pricing
More options …
Volume 8, Issue 1

# Planning repetitive construction projects considering technological constraints

/ Bartłomiej Sroka
Published Online: 2018-12-26 | DOI: https://doi.org/10.1515/eng-2018-0058

## Abstract

Recently, there has been a growing number of construction projects that require more than one structure to be built - repetitive construction projects. These repetitive construction projects are characterized by a high degree of complexity both in terms of organisational and technological dependencies. A method is needed that will flexibly take into account the technological constraints that occur during the carrying out of repetitive construction projects. The article presents a method of priority scheduling that takes into account technological pauses that can prove useful in the planning of repetitive construction projects. The planner (usually a construction site manager) will be able to model the technological constraints occurring on the construction site in a more flexible way. The article also presents a calculation example in which the application of the developed model has been presented. The developed model proved to be effective in scheduling repetitive construction projects, taking into account technological constraints.

## 1 Introduction

An increased number of realization of repetitive construction projects has been observed in recent years. These are usually housing estates, multi-family residential, as well as public and commercial buildings. The carrying out of such construction projects, during which more than one building is to be built creates many difficulties. These are primarily organisational, technological and cost-related problems [1, 2]. This article addresses the issue of scheduling repetitive construction projects in a flexible way, taking into account technological constraints.

Many methods have been developed to support planners in preparing schedules repetitive construction projects. Methods such as: Line of Balance [3], Time-Location Matrix Model [4], Horizontal and Vertical Logic Scheduling for Multistory Projects [5], Time-coupled method [6] as well as other ones [7, 8, 9, 10, 11, 12, 13] are still developed. Scheduling construction works during which many structures are to be built is complicated, which is why many methods have also been developed to support decision making [14].

The article [15] presents the concepts of priority scheduling. Priority scheduling assumes that the planner can determine the validity of restrictions in a flexible way by ranking them. The constraints that are higher in the ranking are considered as priorities and their adherence must be met, further constraints are less important and are to be met under the condition that the constraints that are higher in the ranking allow that. This article extends the priority scheduling model [15] taking into account technological constraints.

The aim of the article is to develop a mathematical model that will allow technological constraints to be adhered to in a flexible way while planning the carrying out of repetitive construction projects. The aim of the article is not to eliminate technological breaks, but to set the dates of initiation and completion of works in order to meet (as much as possible) the assumed technological breaks.

## 2 Priority scheduling model considering technological constraints

The definition and assumptions that were adopted to develop the model have been presented below.

We are given a repetitive construction projects carried out using a flow-shop system. There aremtasks to be completed by m specialised brigades on n structures. The duration of each task is deterministic and is assumed to be known. Once started, tasks cannot be interrupted. The following sets of index pairs have been determined below:

= {(1, 1) , (2, 1) . . . (n − 1, 1) , (1, 2) . . . (n − 1, m)} - helpful in determining flexible time couplings between the tasks performed by a brigade on different structures;

= {(1, 1) , (2, 1) . . . (n, 1) , (1, 2) . . . (n, m − 1)} - helpful in determining flexible time couplings between the tasks performed by different brigades on a single structure; = {(1, 1) , (2, 1) . . . (n, 1) , (1, 2) . . . (n, m)} - the set of index pairs for all tasks.

For such assumptions and defined sets a linear programming model has been developed:

Data: ti,j

Parameters: ${tc}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{og},\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{bg},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{og},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{bg}$

Decision variables: ${S}_{i,j},\phantom{\rule{thinmathspace}{0ex}}{F}_{i,j},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{og},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{bg}$

Goal function: $FC=∑(i,j)∈O^(cki,jod⋅cwi,jod+cki,jog⋅cwi,jog)+∑(i,j)∈B^(cki,jbd⋅cwi,jbd+cki,jbg⋅cwi,jbg)+Fn,m→min$(1)

Constraints:

$Fi,j=Si,j+ti,j,for(i,j)∈W^$(2)$Si+1,j≤Fi,j+tci,jod−cki,jod,for(i,j)∈O^$(3)$Si+1,j≥Fi,j+tci,jog+cki,jog,for(i,j)∈O^$(4)$Si,j+1≤Fi,j+tci,jbd−cki,jbd,for(i,j)∈B^$(5)$Si,j+1≥Fi,j+tci,jbg+cki,jbg,for(i,j)∈B^$(6)$Si,j,Fi,j,cki,jod,cki,jog,cki,jbd,cki,jbg≥0$(7)

The developed model requires knowledge of the duration of tasks being performed on all structures by all brigades (ti,j).

The parametres of the model are: ${tc}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{og}-$the value of the limiting lower and upper flexible time couplings between work on successive structures, as well as their respective unit weights ${cw}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{og}$allowing the calculation of the value of the influence of failure to ensure a flexible coupling on the goal function; ${tc}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{bg}-$the value of limiting upper and lower flexible time couplings between the work of successive brigades and their respective unit weights ${cw}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{bg}$allowing the calculation of the value of the influence of failingto ensure a flexible coupling on the goal function.

The decision variables in the model are: Si,j , F i,j - the time of initiation and completion of work on structure i by brigade $\begin{array}{r}\mathit{\text{j}}\phantom{\rule{thinmathspace}{0ex}};{ck}_{i,j}^{od},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{og},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{bd},\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{bg}-\end{array}$auxiliary variables that allow us to determine by how much did the lower and upper flexible time coupling for performing tasks on structures, as well as the lower and upper flexible time coupling for the work of brigades miss their marks.

The goal function (1) is a sum of several components. The first element determines the value of the failure to ensure lower and upper flexible time coupling between structures. The second element allows us to determine the value of the failure to ensure lower and upper flexible time coupling between the tasks of successive brigades. The third element is the deadline for all work (Zn,m signifies the time of completion of the last work). The objective function will be minimized. This will allow us to set such deadlines for the work of brigades on the structure that best meet the technological constraint with the shortest project completion time.

The model has the following constraints. Formula (2) makes it possible to link the initation and completion dates of all tasks performed during the carrying out of the project. Formulas (3-6) retain the dependencies of the CPM network, taking into account lower and upper flexible time couplings for both structures and brigades, and allow us to determine whether flexible couplings have not been ensured (ck variables). All variables take on non-negative values (7).

Both the constraints and the goal function are linear, which makes this a linear programming model. The model developed by the authors has been implemented in the Python programming language. The Simplex algorithm was used to analyse the model.

Figure 1 shows the concept of flexible time couplings. In a case in which the difference between the date of the initation of a task on structure i+1 by a given brigade and the date of a task’s completion on structure i falls between the values ${tc}_{i,j}^{od}\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}\text{and}\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{og}$(or in the case of tasks being performed on a signle structure by successive brigades: ${tc}_{i,j}^{bd}\phantom{\rule{thinmathspace}{0ex}}\text{and}\phantom{\rule{thinmathspace}{0ex}}{tc}_{i,j}^{bg}\right)$this does not affect the value of the goal function (Figure 1a). In a case in which the aforementioned difference is smaller than the value of the lower flexible coupling by ${tc}_{i,j}^{od}\phantom{\rule{thinmathspace}{0ex}}\text{by}\phantom{\rule{thinmathspace}{0ex}}{ck}_{i,j}^{od}$time units, the goal function will be increased by the quotient of of the value of the failure of ensuring to maintaining this coupling $\left({ck}_{i,j}^{od}\right)$and the determined ${cw}_{i,j}^{od}$weight (Figure 1b). Also in the case of failure to keep the upper flexible coupling by ${ck}_{i,j}^{og}$time units, the goal function will be increased by the quotient ${ck}_{i,j}^{og}\phantom{\rule{thinmathspace}{0ex}}\bullet \phantom{\rule{thinmathspace}{0ex}}{cw}_{i,j}^{og}$(Figure 1c). Flexible couplings between tasks carried out on one site by successive brigades can be interpreted in a similar manner. By adopting appropriate values of cw parameters, constraints can be flexibly complied with according to the priorities set by the planner.

Figure 1

Graphical interpretation of flexible time couplings.

The developed model will be used to schedule repetitive construction projects with technological constrains. The set T will contain work indices after which the technological pause is to take place. Suppose that between task Pk,l and task Pk,l+1, where l ∈ T, there must be a technological pause of at least sl. L̃1will be a sufficiently large number (determined experimentally, it must be a number by at least 2 orders of magnitude greater than the maximum duration of any task) and L̃2 will be much larger (by at least 2 orders of magnitude) than L̃1 (2 1). With these assumptions, an appropriate set of weights was prepared:

$tci,jod=0,cwi,jod=L1~,for(i,j)∈O^$(8)$tci,jog=L1~,cwi,jog=L1~,for(i,j)∈O^$(9)$tci,jbd=0,cwi,jbd=L1~,fori,j∈B^∧j/∈T$(10)$tci,jbd=sj,cwi,jbd=L2~,fori,j∈B^∧j∈T$(11)$tci,jbg=L1~,cwi,jbg=L1~,for(i,j)∈B^$(12)

The weights described in condition (8) will allow the meeting of the general conditions in the CPM network - none of the tasks carried out on structure i + 1 will start before completion of work on structure i.Weights (9) and (12) will ensure that there are no upper limits between the date of initiating a successive work and the compeltion date of a previous work - this applies to tasks performed on subsequent structures (condition 9) as well as to tasks performed by subsequent brigades (condition 12). The weights presented in condition (10) will allow the meeting of general conditions in the CPM network - none of the tasks carried out by brigade j + 1 will commence before the end of brigade j′s work on structure i (this does not apply to tasks that require technological pauses). The weights described in condition (11) will cause the pause between the work of successive brigades on a structure will be equal to at least sj. It should be noted that due to the fact that 2 1 adherence to technological pauses will be more important than maintaining general limitations in the CPM network. Such a developed set of weights will be called set A.

A set of weights which will cause the technological pause to be exactly as long as parameter sl was developed as well:

$tci,jod=0,cwi,jod=L1~,for(i,j)∈O^$(13)$tci,jog=L1~,cwi,jog=L1~,for(i,j)∈O^$(14)$tci,jbd=0,cwi,jbd=L1~,fori,j∈B^∧j/∈T$(15)$tci,jbd=sj,cwi,jbd=L2~,fori,j∈B^∧j∈T$(16)$tci,jbg=L1~,cwi,jbg=L1~,for(i,j)∈B^∧j/∈T$(17)$tci,jbg=sj,cwi,jbg=L2~,for(i,j)∈B^∧j∈T$(18)

Conditions (13-16) are analogous to (8-11). The condition (17) has been modified while condition (18) has been added to impose an upper limit on the length of the technological pause - now it will last exactly sj. This set of weights will be called set B.

The proposed models assume that every day is a work-day.

## 3 Calculation example

To verify the model’s usefulness, a calculation example of the carrying out of works on 5 structures by 4 specialized brigades was developed. Each brigade must perform the following works on every structure: B1 - excavation, B2 - building a strip foundations, B3 - erection of foundation walls, B4 - erecting a floor slab above the basement.

The completion times of individual tasks by the brigades on each structure have been shown in Table 1. A technological pause of at least 7 days must be maintained between the task of Brigade B2 (strip foundations) and B3 (erection of foundation walls). Meanwhile, a technological pause of at least 14 days must be maintained between the task of B3 and B4 (constructing a floor slab over the basemenet).

Table 1

The duration of the tasks performed by each brigade (B1 − B4) on each structure (O1 − O5).

For a problem formulated in this manner, a solution shown on Figure 3 has been obtained using the model developed by the authors in conjunction with weight sets A (weight shown on Figure 2).

Figure 2

Weights set according to the weight set A.

Figure 3

The solution obtained using weight set A. OiBj – work performed on structure i by brigade j, S – tasks initiation time, F – tasks completion deadline, t – task completion time.

Calculations were also performed for an analogous example, assuming that pauses are to last exactly 7 days (between tasks performed by brigades B 2 and B3) and exactly 14 days (between the tasks performed by brigades B3 and B4). In order to solve this problem the authors used the model that has been developed in conjunction with weight set B (weight shown on Figure 4). The solution obtained has been shown in Figure 5.

Figure 4

Weights set according to the weight set B.

Figure 5

The solution obtained using weight set B. Markings as in Figure 3.

Using weight set A, the project will be completed within 80 days. The imposed minimum technological pauses will be maintained, and in some cases will last longer. For example, on structure 2, between tasks performed by brigades B3 and B4, the pause will be 16 days (instead of 14). All constraints resulting from network dependencies were also maintained. There will be no situation in which two different task are being performed simultaneously on one structure. In the case of using weight set

B, the project will be completed within 84 days. In this example, the break must be exactly 14 days long. This results in changing the dates of some tasks and extending the duration of the entire project (compared to the first example). All imposed restrictions were met.

## 4 Conclusions

The presented model of priority scheduling turned out to be possible to implement in the planning of the carrying out of repetitive construction projects featuring technological constrains. Constrains defined in a flexible manner by the decision-maker allow to shape the assumed planning situation in a free manner under assumed technological constraints. The planner only defines the technological constrains and selects the appropriate parameter weights (based on the sets that were developed) to be used in the presented optimization model. The initiation and completion dates of tasks obtained as a result of this optimization can be used to create a schedule. The planner participates only in the collection and input of data and the development of a ranking list. Of course, in the program dedicated to the planner that will developed in the future, the selection of parameters will be performed automatically, implemented in the program’s code.

The presented model, along with a weight set, can be extended to consider additional restrictions, such as: the continuity of performing work by selected brigades, continuity of work on selected structures, imposed deadlines for the completion of structures and other items. Constrains (technological and organisational) would be determined in a flexible way in the form of a ranking list. The proposed approach does not take into account the costs that, when carrying out repetitive construction projects, are an important factor affecting the organisation of the work of brigades. The possibility of changing the order in which structures are being built was not included as well. These aspects will be the subject of further research. The possibility of shortening task completion time or of the technological breaks should also be included.

## References

• [1]

Radziszewska-Zielina, E., Śladowski, G. (2017). Supporting the Selection of a Variant of the Adaptation of a Historical Building with the Use of Fuzzy Modelling and Structural Analysis. Journal of Cultural Heritage, 26, 53–63.

• [2]

Radziszewska-Zielina, E., Śladowski, G.,Sibielak, M. (2017). Planning the reconstruction of a historic building by using a fuzzy stochastic network. Automation in Construction, 84, 242-257.

• [3]

Department of the Navy (1962). Line of Balance Technology: A Graphic Method of Industrial Programming. Offlce of Naval Material.

• [4]

Birrell, G. (1980). Construction Planning—Beyond the Critical Path. Journal of the Construction Division, 106(3), 389-407. Google Scholar

• [5]

Thabet, W., Beliveau, Y. (1994). HVLS: Horizontal and Vertical Logic Scheduling for Multistory Projects. Journal of Construction Engineering and Management, 120(4), 875–892.

• [6]

Rogalska, M., Hejducki, Z. (2017). The application of time coupling methods in the engineering of construction projects. Czasopismo Techniczne, 9, 67-74. Google Scholar

• [7]

Biruk, S., Jaśkowski, P. (2010). Scheduling Construction Of Multi-Object Projects: Problem Of Works Continuity In Consecutive Units (in Polish). Zeszyty Naukowe WSOWL, 3(157), 340-349. Google Scholar

• [8]

Bożejko, W., Hejducki, Z., Uchroński, M., Wodecki, M. (2014). Solving resource-constrained construction scheduling problems with overlaps by metaheuristic. Journal of Civil Engineering and Management, 20(5), 649-659.

• [9]

Krzemiński, M. (2017). Optimization of Work Schedules Executed using the Flow Shop Model. Assuming Multitasking Performed by Work Crews, Archives of Civil Engineering, 63(4), 3-19. Google Scholar

• [10]

Marcinkowski, R. (2017). Modeling constraints in the linear scheduling method (LSM) (in Polish). Scientific Review: Engineering and Environmental Sciences, 26(2), 210-218. Google Scholar

• [11]

Podolski, M. (2017). Management of resources in multiunit construction projects with the use of a tabu search algorithm. Journal of Civil Engineering and Management, 23(2), 263-272.

• [12]

Podolski M. (2016). Scheduling of job resources in multiunit projects with the use of time / cost criteria. Archives of Civil Engineering, 62(1), 143-158.

• [13]

Radziszewska-Zielina, E., Sroka, B. (2017, October 20-22). Selection of the Order of the Construction of Structures of a Multiple-Structure Project. Taking Into Account Time-Cost Optimisation. International Conference on Control Engineering and Mechanical Design (CEMD 2017), (Xiamen, China), 167-177. Google Scholar

• [14]

Jaśkowski, P., Sobotka, A., Czarnigowska, A. (2018). Decision model for planning material supply channels in construction. Automation in Construction, 90, 235-242.

• [15]

Radziszewska-Zielina,E., Sroka, B. (2017). Priority Scheduling in the Planning of Multiple-Structure Construction Projects. Archives of Civil Engineering, 63(4), 21-33.

## About the article

Accepted: 2018-06-23

Published Online: 2018-12-26

Citation Information: Open Engineering, Volume 8, Issue 1, Pages 500–505, ISSN (Online) 2391-5439,

Export Citation