Printer Friendly

The method for improving stability of construction project schedules through buffer allocation/Statybos vykdymo grafiko stabilumo uztikrinimas paskirstant laiko rezervus.

1. Introduction

A schedule is the basic tool used in construction project management. In the case of projects that involve non-cyclic, non-uniform and non-rhythmical processes, the most popular planning techniques are network methods. Among them, the critical path method is used most often, though it does not allow the planner to account for all constraints that occur in the practice of construction operations, in terms of both market conditions and technical operations.

Over the past few years, research efforts in the field of construction project planning concentrated on exact and heuristic procedures for generating project schedules, usually under assumption of deterministic conditions. Most of them considered a variety of constraints and optimization objectives (e.g. Jaskowski, Biruk 2009; Kaplinski 2008a, 2008b; Jaskowski, Sobotka 2006; Christodoulou 2009; Liu, Wang 2008).

Nevertheless, construction processes are especially prone to risk, which affects project performance (Kaplinski, Janusz 2006; Karlowski, Paslawski 2008; Enshassi et al. 2009). Uncertainty has become one of the major factors affecting project execution and ultimate success (Ben-Haim, Laufer 1998). The risk in construction business is very high (Zavadskas et al. 2010). Risk comes from many sources during the whole project life cycle (Shevchenko et al. 2008; Manik et al. 2008). Therefore, the risk assessment problem (Zavadskas et al. 2010; Zhao, Jiang 2009; Miao et al. 2009), the problem of decision-making in risk environment (Peldschus 2008; Kahraman, Kaya 2010; Kaplinski, Tamosaitiene 2010; Ginevicius, Zubrecovas 2009), and risk handling and allocation (e.g. Perera et al. 2009; Kheirkhah et al. 2009) attract the interest of numerous researchers and practitioners. Capturing the risk in the form of risk indices is reckoned to help the planner to shape judgments and to make decisions.

A contractor's project program expressed in the form of a schedule, regardless of the project development phase (bidding, organizing, managing on-site operations), is to be reliable in terms of not only the total project makespan, but also timing of particular tasks and activities--related with resource management. As a result of random events and conditions, a schedule that has been optimized for a set of particular objectives, but determined without consideration to disturbances that may occur, is likely to yield results significantly poorer than expected.

Project planning for uncertainty and risk has been the subject of numerous research efforts since introduction of the PERT model (e.g. Biruk, Jaskowski 2008; Blaszczyk, Nowak 2009; Kaplinski 2008a; Nassar, Casavant 2008). The existing methods that express activity durations as random values (e.g. PERT, GANT, CYCLONE, Petri nets) and simulation models (e.g. Klimov, Merkuryev 2008; Kaplinski 2009) focus mainly on estimating either the probability of conforming to the contractual completion date, or the project duration at a predefined confidence level. The problem of practical workflow planning is thus somehow neglected, as the methods mentioned above do not account for the problem of defining activity starts (other than "early starts") and introducing subcontractors (or resource management in general). Moreover, the analysis of schedules obtained by means of the above methods provides information in the form of probabilistic values, which is not easy to interpret for practical planning of the project logistics.

Deficiencies of the existing methods gave rise to the worldwide search for more reliable methods of project planning, such as predictive (or proactive) scheduling that is expected to provide robust schedules (immune to disturbances), thus counteracting instability and "nervousness" of a project plan.

It is believed that a perfect schedule should combine solution robustness (i.e. it should be stable) and quality robustness (i.e. it should be makespan protective) (Van de Vonder et al. 2005). Therefore, recent analyses aim at constructing robust baseline schedules. They are often proactive, which seems more effective than adoption of a purely reactive approach of rescheduling and updating the plan during execution. Paslawski (2008) proposed to improve the efficiency of the reactive approach by increasing flexibility of construction process engineering, based on creating multiple variants for process realization options, thus enabling adaptation to current realization conditions.

A construction project is characterized by a high number of project participants and multitude of contract relations (Schieg 2008). The main cause of the need for stable baseline schedules is the "advance booking" of key staff or equipment (to guarantee their availability) and fixed delivery dates required by suppliers or subcontractors (Herroelen, Leus 2004). Scheduling with fixed dates of employing resources makes planning easier--allows the contractor to manage project portfolio and restrict propagation of interferences from one project to the other. Furthermore, not keeping to the contract due date and milestones is usually connected with penalties.

A widely used method to increase stability of a schedule with a predefined due date is including time buffers between processes (Jaskowski, Biruk 2010).

2. Literature review

Buffering is a common practice in project management. Lill (2009) recommented buffer in form of buildings with no duration limits in construction programme as labour management compensators for improving the arrangement of labour resources. Buffers in form of idle periods guarantee the completion of an activity or a project on time. However, the existing methods of time buffer positioning and sizing are often criticized by the researchers.

Goldratt (1997) introduced three types of time buffers according to their function. The project buffer is placed at the end of the critical chain (the longest chain of precedence of resources dependent processes) to protect the project due date. Feeding buffers are inserted to protect the critical chain against disruptions from non-critical processes and placed at points where non-critical chains join the critical chain. Resource buffers alongside the critical chain should ensure resources availability. Critical chain scheduling, or buffer management (CC/BM), being the Goldratt's Theory of Constraints application to project management, assumes that the baseline schedule should be created using median durations estimates of the processes. However, introduction of the project buffer may lead to unnecessarily late project due dates, and the feeding buffers fail to prevent propagation of schedule disruptions in most cases (Van de Vonder et al. 2005). Moreover, CC/BM approach does not provide the baseline schedule with fixed start times of processes. Instead, processes are to start as soon as possible.

In contrast to the above approach, the authors assume that, as the project runs, some or all processes are not allowed to start before their start time planned in the baseline schedule. This policy is called railway scheduling.

Some planners treat a contingency buffer as an integral part of each activity, without a clear distinction from the original duration estimate (Park, Pena-Mora 2004). This approach and positioning a buffer at the end of an activity may lead to a so called "student syndrome"--a situation when a contractor responsible for a particular task waits until the last possible moment to start. Thus, a buffer does not protect an activity start date causing unnecessary interruptions in work flow. Therefore, some authors suggest placing time buffers in front of processes (Goldratt 1997; Park, Pena-Mora 2004; Herroelen, Leus 2004; Van de Vonder et al. 2008).

The size of a contingency buffer is normally decided on the basis of individual experience and assigned in a uniform way, usually as a fixed fraction of activity duration, instead of considering particular qualities of each individual activity (Park, Pena-Mora 2004). Two main factors should be taken into consideration while determining the size of the buffer in front of a process:

--the variability of all the processes that precede the process in the schedule (because it affects the probability that process can start at its scheduled starting time),

--and the weight or unit cost of process start time disruption.

The evaluation of quality of a buffered schedule is generally based on measures which are used to quantify the capacity of this schedule to remain efficient in random circumstances (Ghezail et al. 2009), but there are no generally agreed definitions or measures of robustness. Al-Fawzan, Haouari (2005) proposed to measure the schedule robustness with the total sum of free floats. This way, the robustness of the schedule was defined as the ability to execute the project without any delays in start of project's processes. Kobylanski, Kuchta (2007) state that a better measure of the schedule robustness would be the minimal free float. The planner's task should be thus maximizing the minimum of free floats. This way, start date of each activity would be protected (which means solution robustness) and the makespan of the whole project would be assured (which means quality robustness). This approach fuses solution and quality robustness. There is also no need to determine weights of makespan and robustness criteria like in a bi-objective model presented by Al-Fawzan, Haouari (2005). Robustness of a schedule can be measured also by the minimum of the free float to duration ratios calculated for all processes (Kobylanski, Kuchta 2007).

According to Herroelen, Leus (2004) and Van de Vonder et al. (2005 and 2006), a stable schedule with acceptable makespan performance should minimize the instability cost function, defined as the weighted sum of the expected absolute deviations between the predicted start times and the value that the random variable of start time will assume during schedule execution.

An optimization model of the buffer sizing problem (minimizing the instability cost), concerning the case of disruption to a single activity, with discrete disruption scenario, was presented by Herroelen, Leus (2004). However, in terms of computational effort, it is inefficient to search for exact optimal solutions of practical complex problems. Therefore, the literature on the subject proposes numerous heuristic and meta-heuristic algorithms for allocating buffers throughout the schedule but only adequate for the railway policy for starting all of the processes.

The adapted float factor and resource flow dependent float factor heuristic (Van de Vonder et al. 2005, 2006; Herroelen, Leus 2004) relies on the activity weights, but it does not exploit the information on the activity duration distributions for making its buffering decisions.

The concept of a float factor was introduced by Tavares et al. (1998) as a way of augmenting the earliest processes start time by the same fraction of the total float. This is to reduce the risk of not meeting project due date and to decrease the discounted project cost.

This procedure starts with an unbuffered schedule and modifies it by adding safety buffers in the front of processes. The start time of a process j is calculated as [s.sub.j] = [s.sub.j](U) + aj x [float.sub. j], where [s.sub.j](U) denotes the earliest start of process j in the initial unbuffered schedule, [[alpha].sub.j]--the float factor, and float j - the total float of process j in the unbuffered schedule. The float factors are calculated as [[alpha].sub.j] = [[beta].sub.j]/([[beta].sub.j] + [[lambda].sub.j]), where [[beta].sub.j] is the sum of the weight of activity j and the weights of all its transitive predecessors in the network, while [[lambda].sub.j] is the sum of the weights of all transitive successors of activity j. The weights of activities that start at time 0 are not included in the above sums as it is assumed that these activities can always start at their planned start dates. Thus, there is no need of buffering to cope with possible disruptions of their predecessors.

The virtual activity duration extension heuristic (Van de Vonder et al. 2005, 2006; Herroelen, Leus 2004) relies on the standard deviations of the of the processes' durations, used to compute a modified duration for constructing the baseline schedule. The standard deviations are used at each iteration of the algorithm to select a non-dummy process for which virtual duration extensions is made. Duration extensions require schedule (early starting times) update and allow the planner to calculate buffer size in the baseline schedule with original expected activity durations. At every iteration step, the instability cost of the schedule is evaluated by simulation.

The starting time criticality heuristic (Van de Vonder et al. 2005, 2006; Herroelen, Leus 2004) tries to combine information on activity weights and activity duration variances. Based on an initial unbuffered schedule, intermediate schedules are created, in iterative way, by adding a one-unit time buffer in the front of the most critical activity until increasing contingency buffers no longer improves stability. The process criticality is measured by a multiplication of the probability of a process' not starting on its scheduled date and the unit cost of the process' deviating from its start time. This probability is estimated under assumption that only one activity at a time disturbs the start time of the process.

An extensive simulation-based analysis of the performance of heuristic and meta-heuristic algorithms of buffer allocation presented in (Van de Vonder et al. 2008) revealed that heuristics that use information on the unit cost of a process' start time deviation and process duration variability yield better solutions. Van de Vonder et al. (2008) present an improvement to the above heuristics based on searching better neighborhood solutions (their fitness is assessed by simulation technique), constructed by changing processes buffers sizes (in taboo search procedure) or starting times within displacement interval without affecting the starting times of other processes in the buffered or unbuffered schedule. This procedure reduces the instability cost by reallocating buffers and reducing floats. However, because of computational effort, it is adequate only for small test problems.

3. Proposed approach to buffer sizing

The precedence relationships between schedule activities, i.e. construction processes, have been modeled by a unigraph G = <V,E>, directed, acyclic, in activity-on-the-node representation with single start and end nodes. V = {l, 2, ..., n} is a set of construction processes (nodes), E [subset] V x V is a bi-argument relation representing precedence relationships between processes (arcs).

Each process is assigned a duration [d.sub.j], established using mean productivity estimates, equal to expected values of durations distributions. These duration estimates are used for creating the baseline schedule.

Each non-dummy process j has a weight [c.sub.j] that denotes the unit cost of delaying its start, the delay being the difference between the actual and the start time assumed in the baseline schedule (nonnegative cost per unit time overrun on the start time of activity). A small activity weight reflects high scheduling flexibility or low instability cost. For example activities that depend on resources with non availability limits will be given a small weight. A heavy weight reflects small scheduling flexibility: deviations between actual and planned starting times are deemed very costly for the contractor, e.g. high penalties that are incurred when individual milestones or the project due date are not met (Herroelen, Leus 2004). The cost of the final dummy activity n denotes the cost of delaying the project completion beyond the predetermined (contractual) due date [T.sub.d]. As the contract gave high importance to meeting the planned due date of the project, a large weight had to be given to the activity marking the project completion.

Processes whose [c.sub.j] > 0 start in accordance with railway policy--not before the start date predefined in the baseline schedule. This policy can be applied also to the remaining processes.

The objective is to build a stable precedence feasible schedule with acceptable makespan performance by minimizing the function of schedule instability cost:

C = [n.summation over (j=1)][C.sub.j]E([s.sub.j] - [s.sub.j]), (1)

defined as the weighted sum of the expected shifts of the actual starting time [s.sub.j] from the predicted starting time [s.sub.j] of the baseline schedule.

Buffers [[delta].sub.j] are introduced to prevent propagation of disruptions throughout the schedule. These buffers are idle periods (gaps) in the schedule between the planned start of a process considered and the latest planned finish of its predecessors (the earliest start of the process). The buffers can absorb disruptions in process durations without affecting other processes and the schedule logic. This way, coordination of resource and material procurement for each activity can be performed as smoothly as possible.

The buffer size should stay--in the opinion of the authors--in proportion to the process variability and to the cost of a possible delay beyond the earliest start in the baseline schedule.

To establish the possible delay it is necessary to perform simulations, especially in the case of different process starting policies used during project execution, such as the railway or as early as possible policy.

Buffer size is established in the following steps:

1. Calculation of the minimal project duration Tmin, the early start times of all activities, [s.sup.0.sub.j], and their total floats, [float.sup.0.sub.j], according to the baseline schedule based on expected values of activity durations, [d.sub.j].

2. Simulations of the project progress on the basis of the network model assuming that activity durations are random variables of predefined probability distribution, and that the activities start in accordance with the assumed starting policy.

The simulation enables the planner to estimate expected values of activity delays [DELTA][s.sub.j] = [s.sup.1.sub.j] - [s.sup.0.sub.j], where [s.sup.1.sub.j] is the mean start date of a process j [member of] V calculated on the basis of simulation results.

Assuming that the contractual project duration is known and equals [T.sub.d], the total float of an activity j [member of] V is [float.sub.j] = [float.sup.0.sub.j] + [T.sub.d] - [T.sub.min].

The existing floats in the baseline schedule, having the form of time buffers, should be allocated among processes according to process weights, [w.sub.j], calculated according to the formula:

[w.sub.j] = [c.sub.j] x ([DELTA][s.sub.j] + 3[[sigma].sub.j]), (2)

where [[alpha].sub.j] is the standard deviation of the simulated activity start dates.

This approach to determining weights is similar to the process criticality concept presented by Kuchta (2000) and results from the fact that buffer sizes less than [[DELTA][s.sub.j] + 3[[sigma].sub.j] do not eliminate propagation of disruption in the network.

3. Buffer sizes calculations. The mathematical model of the buffer [[delta].sub.j] sizing problem can be formulated as follows:


[s.sub.1] = 0, (4)

[s.sub.j] - [[delta].sub.j] [greater than or equal to] [s.sub.i] + [d.sub.i], [for all](i, j) [member of] E, (5)

[s.sub.n] + [d.sub.n] [less than or equal to] [T.sub.d], (6)

[s.sub.j] [greater than or equal to] 0, [for all]j [member of] V, (7)

[[delta].sub.j] [greater than or equal to] 0, [for all]j [member of] V, (8)

[[delta].sub.j] = 0, [for all]j [member of] V\H, (9)

[[delta].sub.j] [member of] int, [for all]j [member of] H, (10)

where H = {j: [w.sub.j] > 0}.

The objective function (3) is used for proper buffer sizing (float allocation) according to processes' weights. Execution of the first process of the project (i.e. a process that has no predecessors) starts at the moment 0 (4). The condition (5) is required to establish processes' start dates. The project should end before the predefined deterministic due date [T.sub.d] (6).

To facilitate the computations a mixed linear-integer model can be constructed by modifying the objective function and adding one condition:

max z = [xi], (11)

[[delta].sub.j]/[float.sub.j] [greater than or equal to] [w.sub.j][xi], [for all]j [member of] H. (12)

To solve this model, some widely available software can be used (e.g. Lp_Solve Open Source Mixed-Integer Linear Programming System, version, by Michel Berkelaar, Kjell Eikland, Peter Notebaert GNU LGPL).

Optimal solutions of the problem described above differ in buffer sizes of non-critical activities. The solution for which the sum of buffers is the least should be selected from the set of all solutions. Thus, buffers of non-critical activities may be increased or decreased unless it raises the cost of schedule instability.

It is possible to improve the solution using the following procedure that should be run for non-critical activities of the same path between the project's start and end:

1. Find value of the schedule instability cost, C(1), on the basis of simulation using current schedule.

2. For each non-critical activity in the same path, find values [C'.sub.j+], [C'.sub.j-] of instability cost function (1) on the basis of simulations of new schedules created by increasing or decreasing the buffer by a unit of time.

3. If there exists an activity whose [DELTA][C.sub.j[+ or -]] = [C'.sub.j[+ or -]] - C < 0, go to step 4. In other case, finish the procedure and consider the current schedule to be the best.

4. Establish the number of the activity j* for which [DELTA][C.sub.j+] or [DELTA][C.sub.j-] is minimal. Then change its buffer by a unit of time so to get maximum reduction of instability cost.

5. The resulting schedule is considered the current solution. Assume C := [C'.sub.j*[+ or -]] and go to step 2.

In the remainder of the paper, the above procedure is referred to as the improvement procedure.

4. Example

Figure 1 presents an example of a construction project network model. Table 1 lists the estimates of parameters of activity durations under assumption that probability distributions of these durations are triangular ([a.sub.j]--the shortest possible duration, [m.sub.j]--the most probable duration, [b.sub.j]--the longest possible duration, [d.sub.j]--the expected duration), and [c.sub.j]--the unit costs of delaying the activities' start. Minimal project duration calculated on the basis of mean process durations is 75 days. The proposed method was used to find the project schedule of due date 80 days after start that fulfills a requirement of minimizing the expected cost of delaying the start of processes beyond their predicted (scheduled) start times.

The expected delay of each process and standard deviations was established by Monte Carlo simulation (30 000 runs). Simulations were conducted by means of GPSS Worldtm Personal Version by Minuteman Software (education license) for two variants of the project execution:

--in the first variant, all activities start according to the railway policy,

--in the second variant, only the activities j [member of] H start no sooner than on the dates [s.sup.0.sub.j], defined in the baseline schedule, and the remaining activities start immediately after all their predecessors finish.


Buffer sizes were found by solving the model given by equations (4)-(10) and (11)-(12) by means of Lp_solve software. Then the procedure of improving the solution was applied. The results of calculations are presented in Table 2 (first variant) and Table 3 (second variant). A bar chart of the buffered schedules is presented in Figs 2 and 3.


Buffer sizes calculated using the adapted float factor heuristic are as follows: [[delta].sub.3] = 1, [[delta].sub.5] = 0 , [[delta].sub.9] = 4, [[delta].sub.11] = 7, [[delta].sub.15] = 5, [[delta].sub.18] = 3, [[delta].sub.j] = 0 [for all]j [member of] V\H . Using the starting time criticality heuristic, following buffer sizes were obtained: [[delta].sub.3] = 1, [[delta].sub.5] = 1, [[delta].sub.9] = 3 , [[delta].sub.11] = 3, [[delta].sub.15] = 2 [[delta].sub.18] = 3 , [[delta].sub.j] = 0 [for all]j [member of] V\H.

Table 4 lists values of the instability cost function, established by simulation, of schedules with buffer sizes calculated by means of the proposed method, the adapted float factor, and starting time criticality heuristics. Application of all these procedures significantly improves the stability of the schedule--the instability cost is over four times lower than in the unbuffered schedule. The solution obtained by means of the proposed method with improvement procedure is better than solutions obtained by the starting time criticality heuristic (most widely presented in the literature).


5. Conclusions

A stable baseline schedule is crucial for the success of construction projects. Changes to the program introduced in reaction to process duration disruptions result in difficulties with managing subcontractors and suppliers. Furthermore, not keeping to the contract due date and milestones is usually connected with penalties.

Instability of the schedule may seriously affect continuity of works, labor and delivery cost, management effort, etc. Proper buffer sizing and placement enables the planner to protect the project against disruptions that occur during execution and to minimize the cost of not keeping to the baseline. The scale of the schedule instability cost is affected also by the policy of starting the processes: the railway policy is related with greater cost, while the possibility to start activities as soon as their predecessors finish reduces the possibility of delaying the activities to follow.

The proposed method seems better than simple heuristics that do not allow for the probabilistic nature of process duration and are applicable only in the case of the railway policy. The float distribution rule employed by the proposed approach considers both duration variability and propagation of disruptions in the network. As the example illustrates, the method provides results similar in their quality to the results of the best known heuristic procedures. Its considerable advantage is the possibility to analyze resource constraints and to improve resource allocation (i.e. to change the resource allocation adopted in the baseline schedule). In contrast, methods presented in the literature on the subject consider only buffer allocation in baseline schedules and provide resource constraints feasible solutions while maintaining the initial resource flow. The proposed improvement procedure has the potential of providing solutions superior to those obtained by the existing heuristics.

doi: 10.3846/20294913.2011.580587


The work was financed by the Polish Ministry of Science and Higher Education (grant no. N N506 254637).


Al-Fawzan, M. A.; Haouari, M. 2005. A bi-objective model for robust resource-constrained project scheduling, International Journal of Production Economics 96(2): 175-187. doi:10.1016/j.ijpe.2004.04.002

Ben-Haim, Y.; Laufer, O. 1998. Robust reliability of projects with activity-duration uncertainty, Journal of Construction Engineering and Management ASCE 124(2): 125-132. doi:10.1061/(ASCE)0733-9364(1998)124:2(125)

Biruk, S.; Jaskowski, P. 2008. Simulation modelling construction project with repetitive tasks using Petri nets theory, Journal of Business Economics and Management 9(3): 219-226. doi:10.3846/1611-1699.2008.9.219-226

Blaszczyk, T.; Nowak, M. 2009. The time-cost trade-off analysis in construction project using computer simulation and interactive procedure, Technological and Economic Development of Economy 15(4): 523-539. doi:10.3846/1392-8619.2009.15.523-539

Christodoulou, S. 2009. Construction imitating ants: Resource-unconstrained scheduling with artificial ants, Automation in Construction 18(3): 285-293. doi:10.1016/j.autcon.2008.09.005

Enshassi, A.; Mohamed, S.; Abushaban, S. 2009. Factors affecting the performance of construction projects in the Gaza Strip, Journal of Civil Engineering and Management 15(3): 269-280. doi:10.3846/1392-3730.2009.15.269-280

Ghezail, F.; Pierreval, H.; Hajri-Gabouj, S. 2009. Analysis of robustness in proactive scheduling: A graphical approach, Computers and Industrial Engineering 58(2): 193-198. doi:10.1016/j.cie.2009.03.004

Ginevicius, R.; Zubrecovas, V. 2009. Selection of the optimal real estate investment project basing on multiple criteria evaluation using stochastic dimensions, Journal of Business Economics and Management 10(3): 261-270. doi:10.3846/1611-1699.2009.10.261-270

Goldratt, E. 1997. Critical Chain. The North River Press Publishing Corporation, Great Barrington, MA. Herroelen, W.; Leus, R. 2004. The construction of stable project baseline schedules, European Journal of Operational Research 156(3): 550-565. doi:10.1016/S0377-2217(03)00130-9

Jaskowski, P.; Sobotka, A. 2006. Scheduling construction projects using evolutionary algorithm, Journal of Construction Engineering and Management ASCE 132(8): 861-870. doi:10.1061/(ASCE)0733-9364(2006)132:8(861)

Jaskowski, P.; Biruk, S. 2009. The work continuity constraints problem in construction projects' network models, Archives of Civil Engineering 55(1): 29-41.

Jaskowski, P.; Biruk, S. 2010. Buffer sizing method for constructing stable schedules of time-limited projects, in Selected papers of the 10th International Conference on Modern Building Materials, Structures and Techniques, Vilnius, Lithuania, May 19-21, 2010, 419-424.

Kahraman, C.; Kaya, 1. 2010. Investment analyses using fuzzy probability concept, Technological and Economic Development of Economy 16(1): 43-57. doi:10.3846/tede.2010.03

Kaplinski, O.; Janusz, L. 2006. Three phases of multifactor modelling of construction processes, Journal of Civil Engineering and Management 12(2): 127-134.

Kaplinski, O. 2008a. Planning instruments in construction management, Technological and Economic Development of Economy 14(4): 449-451. doi:10.3846/1392-8619.2008.14.449-451

Kaplinski, O. 2008b. Development and usefulness of planning techniques and decision-making foundations on the example of construction enterprises in Poland, Technological and Economic Development of Economy 14(4): 492-502. doi:10.3846/1392-8619.2008.14.492-502

Kaplinski, O.; Tamosaitiene, J. 2010. Game theory applications in construction engineering and management, Technological and Economic Development ofEconomy 16(2): 348-363. doi:10.3846/tede.2010.22

Kaplinski, O. 2009. Information technology in the development of the Polish construction industry, Technological and Economic Development ofEconomy 15(3): 437-452. doi:10.3846/1392-8619.2009.15.437-452

Karlowski, A.; Paslawski, J. 2008. Monitoring of construction processes in the variable environment, Technological and Economic Development ofEconomy 14(4): 503-517. doi:10.3846/1392-8619.2008.14.503-517

Kheirkhah, A. S.; Esmailzadeh, A.; Ghazinoory, S. 2009. Developing strategies to reduce the risk of hazardous materials transportation in Iran using the method of fuzzy SWOT analysis, Transport 24(4): 325-332. doi:10.3846/1648-4142.2009.24.325-332

Kobylanski, P.; Kuchta, D. 2007. A note on the paper by M. A. Al-Fawzan and M. Haouari about bi-objective problem for robust resource-constrained project scheduling, International Journal of Production Economics 107(2): 496-501. doi:10.1016/j.ijpe.2006.07.012

Kuchta, D. 2000. Use of fuzzy numbers in project risk (criticality) assessment, International Journal of Project Management 19(5): 305-310. doi:10.1016/S0263-7863(00)00022-3

Lill, I. 2009. Multiskilling in construction--a strategy for stable employment, Technological and Economic Development ofEconomy 15(4): 540-560. doi:10.3846/1392-8619.2009.15.540-560

Liu, S. S.; Wang, Ch. J. 2008. Resource-constrained construction project scheduling model for profit maximization considering cash flow, Automation in Construction 17(8): 966-974. doi:10.1016/j.autcon.2008.04.006

Manik, A.; Gopalakrishnan, K; Singh, A.; Yan, S. 2008. Neural networks surrogate models for simulating payment risk in pavement construction, Journal of Civil Engineering and Management 14(4): 235-240. doi:10.3846/1392-3730.2008.14.22

Miao, X.; Yu, B.; Xi, B. 2009. The uncertainty evaluation method of supply chain reliability, Transport 24(4): 296-300. doi:10.3846/1648-4142.2009.24.296-300

Nassar, K.; Casavant, A. 2008. Analysis of timed Petri nets for reachability in construction applications, Journal of Civil Engineering and Management 14(3): 189-198. doi:10.3846/1392-3730.2008.14.16

Park, M.; Pena-Mora, F. 2004. Reliability buffering for construction projects, Journal of Construction Engineering and Management ASCE 130(5): 626-637. doi:10.1061/(ASCE)0733-9364(2004)130:5(626)

Paslawski, J. 2008. Flexibility approach in construction process engineering, Technological and Economic Development ofEconomy 14(4): 518-530. doi:10.3846/1392-8619.2008.14.518-530

Peldschus, F. 2008. Experience of the game theory application in construction management, Technological and Economic Development ofEconomy 14(4): 531-545. doi:10.3846/1392-8619.2008.14.531-545

Perera, B. A. K. S.; Dhanasinghe, I.; Rameezdeen, R. 2009. Risk management in road construction: the case of Sri Lanka, International Journal of Strategic Property Management 13: 87-102. doi:10.3846/1648-715X.2009.13.87-102

Schieg, M. 2008. Strategies for avoiding asymmetric information in construction project management, Journal of Business Economics and Management 9(1): 47-51. doi:10.3846/1611-1699.2008.9.47-51

Shevchenko, G.; Ustinovichius, L.; Andruskevicius, A. 2008. Multi-attribute analysis of investments risk alternatives in construction, Technological and Economic Development of Economy 14(3): 428-443. doi:10.3846/1392-8619.2008.14.428-443

Tavares, L. V.; Ferreira, J. A. A.; Coelho, J. S. 1998. On the optimal management of project risk, European Journal of Operational Research 107(2): 451-469. doi:10.1016/S0377-2217(97)00344-5

Van de Vonder, S.; Demeulemeester, E.; Herroelen, W. 2008. Proactive heuristic procedures for robust project scheduling: An experimental analysis, European Journal of Operational Research 189(3): 723-733. doi:10.1016/j.ejor.2006.10.061

Van de Vonder, S.; Demeulemeester, E.; Leus, R.; Herroelen, W. 2006. The trade-off between stability and makespan in resource-constrained project scheduling, International Journal of Production Research 44(2): 215-236. doi:10.1080/00207540500140914

Van de Vonder, S.; Demeulemeester, E.; Leus, R.; Herroelen, W. 2005. The use buffers in project management: The trade-off between stability and makespan, International Journal of Production Economics 97(2): 227-240. doi:10.1016/j.ijpe.2004.08.004

Zavadskas, E. K.; Turskis, Z.; Tamosaitiene, J. 2010. Risk assessment of construction projects, Journal of Civil Engineering and Management 16(1): 33-46. doi:10.3846/jcem.2010.03

Zhao, L. D.; Jiang, Y. P. 2009. A game theoretic optimization model between project risk set and measure set, International Journal of Information Technology and Decision Making 8(4): 769-786. doi:10.1142/S0219622009003697

Piotr Jaskowski (1), Slawomir Biruk (2)

Lublin University of Technology, Faculty of Civil Engineering and Architecture, Nadbystrzycka str. 40, 20-618 Lublin, Poland

E-mails: (1) (corresponding author); (2)

Received 25 August 2010; accepted 28 March 2011

Piotr JASKOWSKI. Ph. Dr at Lublin University of Technology, Poland. He is a Head of the Group of Construction and Investments Processes Engineering working in the Building Institute. He is a member of the Section of the Engineering of Construction Projects in Civil Engineering Committee of Polish Academy of Science. He is the member of EURO Working Group "OR in Sustainable Development and Civil Engineering" and International Group on Reliability. His research interests include the organization and modeling of construction processes, construction projects scheduling, and optimization techniques.

Slawomir BIRUK. Ph. Dr at Lublin University of Technology, Poland. He is the member of EURO Working Group "OR in Sustainable Development and Civil Engineering" and International Group on Reliability. His research interests include the organization and modeling of construction processes, construction projects scheduling, optimization techniques, simulation modeling, construction methods and equipment.
Table 1. Estimates of processes durations and costs
of start delaying (example)

j    Process               [a.sub.j]   [m.sub.j]   [b.sub.j]

1    start                     0           0           0
2    site preparation          5           6           8
3    excavations               4           5           7
4    foundation                8          10          15
5    basement walls            3           4           7
6    basement floor slab       3           4           7
7    brickwork                15          18          25
8    roof structure            7           8          10
9    roof cladding             5           6           8
10   external services         2           3           4
11   backfill                  1           2           4
12   partition walls           3           5           8
13   plastering                8          10          15
14   painting                  5           6           9
15   facade works             10          12          18
16   plumbing                 10          12          15
17   site works               14          16          22
18   finish                    0           0           0

j    Process               [d.sub.j]   [c.sub.j]

1    start                     0           0
2    site preparation          6           0
3    excavations               5           7
4    foundation               11           0
5    basement walls            5           5
6    basement floor slab       5           0
7    brickwork                19           0
8    roof structure            8           0
9    roof cladding             6           6
10   external services         3           0
11   backfill                  2           5
12   partition walls           5           0
13   plastering               11           0
14   painting                  7           0
15   facade works             13           9
16   plumbing                 12           0
17   site works               17           0
18   finish                    0          10

Table 2. Results of calculations by the proposed method--the first

     [s.sup.0   [s.sup.1   [DELTA]     [[sigma]               [float
     .sub.j]    .sub.j]    [s.sub.j]   .sub.j]    [w.sup.j]   .sub.j]

j    [days]     [days]     [days]      [days]     w. i        [days]

1    0          0          0           0          0           0
2    0          0          0           0          0           5
3    6          6.4192     0.4192      0.5714     14.9351     5
4    11         11.8004    0.8004      0.8146     0           5
5    22         23.1165    1.1165      1.3333     25.5818     5
6    27         28.0487    1.0487      1.3391     0           5
7    32         32.9997    0.9997      1.3401     0           5
8    51         52.7565    1.7565      2.0191     0           8
9    59         61.1249    2.1249      2.0952     50.4624     8
10   6          6.4192     0.4192      0.5714     0           39
11   32         32.9997    0.9997      1.3401     25.1000     16
12   51         52.7565    1.7565      2.0191     0           5
13   56         58.2034    2.2034      2.1632     0           6
14   68         70.8522    2.8522      2.3372     0           5
15   34         35.3795    1.3795      1.4591     51.8100     16
16   56         58.2034    2.2034      2.1632     0           5
17   47         48.9383    1.9383      1.9910     0           16
18   75         77.5163    2.5163      2.5039     100.2802    5


      Proposed      Proposed
       method        method
       without        with
     improvement   improvement
j     procedure     procedure

1         0             0
2         0             0
3         1             1
4         0             0
5         1             1
6         0             0
7         0             0
8         0             0
9         3             3
10        0             0
11        3             4
12        0             0
13        0             0
14        0             0
15        5             2
16        0             0
17        0             0
18        3             3

Table 3. Results of calculations by the proposed
method--the second variant

     [s.sup.0   [s.sup.1   [DELTA]     [[sigma]               [float
     .sub.j]    .sub.j]    [s.sub.j]   .sub.j]    [w.sup.j]   .sub.j]

j    [days]     [days]     [days]      [days]     w. i        [days]

1    0          0          0           0          0              0
2    0          0          0           0          0              5
3    6          6.4161     0.4161      0.5706     11.9836        5
4    11         11.7448    0.7448      0.8905     0              5
5    22         23.0967    1.0967      1.3274     21.9914        5
6    27         27.7578    0.7578      1.6161     0              5
7    32         32.4317    0.4317      1.8518     0              5
8    51         51.7601    0.7601      2.8104     0              8
9    59         60.7630    1.7630      2.1450     41.2008        8
10   6          6.3319     0.3319      0.6877     0             39
11   32         32.9397    0.9397      1.3485     29.0428       16
12   51         51.7601    0.7601      2.8104     0              5
13   56         57.1001    1.1001      3.0191     0              6
14   68         69.8101    1.8101      3.0274     0              5
15   34         35.3235    1.3235      1.4640     49.4291       16
16   56         57.1001    1.1001      3.0191     0              5
17   47         48.6524    1.6524      2.2773     0             16
18   75         76.4748    1.4748      3.159      105.7705       5


      Proposed      Proposed
       method        method
       without        with
     improvement   improvement
j     procedure     procedure

1         0             0
2         0             0
3         1             1
4         0             0
5         1             1
6         0             0
7         0             0
8         0             0
9         2             3
10        0             0
11        3             5
12        0             0
13        0             0
14        0             0
15        5             2
16        0             0
17        0             0
18        3             3

Table 4. Comparison of schedule (solution) robustness obtained using
different methods

                                       Instability cost

Method used to           Railway policy for      Railway policy only
buffer sizing            all activity starts      for activities j
                           (first variant)          [member of] H
                                                  (second variant)

Proposed method with            10.42                   8.33

Proposed method                 10.65                   9.84
without improve-
ment procedure

Adapted float factor            12.57                   11.47

Starting time                   10.52                   8.42

Unbuffered schedule             41.50                   38.11
COPYRIGHT 2011 Vilnius Gediminas Technical University
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2011 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Jaskowski, Piotr; Biruk, Slawomir
Publication:Technological and Economic Development of Economy
Article Type:Report
Geographic Code:4EXPO
Date:Sep 1, 2011
Previous Article:Multiple criteria decision making (MCDM) methods in economics: an overview/Daugiatiksliai sprendimu priemimo metodai ekonomikoje: apzvalga.
Next Article:Contribution-based profit-sharing scheme for joint ventures/Pelno pasidalijimo tarp imoniu schema, pagrista patirtomis islaidomis.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |