Purpose The purpose of this paper is to present an efficient model for project buffer sizing by taking failure mode and effects analysis (FMEA) into account to reach a more realistic schedule. Design/methodology/approach In the first phase of the project, several turbines were installed according to the primary schedule with an average duration of 142 days. Then, some of critical chain project management algorithms were separately applied in the implementation and installation of the other wind turbines. The adaptive procedure with resource tightness (APRT) method turned out to be the best method in terms of obtaining a more realistic schedule in this case study. Finally, FMEA was simultaneously applied with APRT. Findings Applying the hybrid method to the scheduling of the wind turbines, yielded the more realistic schedule than traditional. Research limitations/implications The proposed hybrid APRT-FMEA algorithm was implemented on a real wind farm construction project which was completed with 37 percent shorter duration than the initial estimation; in spite of the initial estimation of 142 days, the project completed in 103 days. Practical implications Introducing and implementing a new algorithm which is a combination of buffer sizing algorithms and one of the well-known and mostly used risk assessment methods in order to provide the more realistic project schedule in the construction of wind turbines. Originality/value Introducing and implementing a novel algorithm which is a combination of conventional buffer sizing method and one of the efficient risk assessment methods in order to make the schedule more realistic.

Purpose This study aims to introduce an efficient project buffer and resource management (PBRM) model for project resource leveling and project buffer sizing and controlling of project buffer consumption of a wind power plant project to achieve a more realistic project duration. Design/methodology/approach The methodology of this research consists of three main phases. In the first phase of the research methodology, resource leveling is done in the project and resource conflicts of activities are identified. In the second phase, the project critical chain is determined, and the appropriate size of the project buffer is specified. In the third phase of the methodology, buffer consumption is controlled and monitored during the project implementation. After using the PBRM method, the results of this project were compared with those of the previous projects. Findings According to the obtained results, it can be concluded that using PBRM model in this wind turbine project construction, the project duration became 25 per cent shorter than the scheduled duration and also 29 per cent shorter than average duration of previous similar projects. Research limitations/implications One of the major problems with projects is that they are not completed according to schedule, and this creates time delays and losses in the implementation of projects. Today, as projects in the energy sector, especially renewable projects, are on the increase and also we are facing resource constraint in the implementation of projects, using scheduling techniques to minimize delays and obtain more realistic project duration is necessary. Practical implications This research was carried out in a wind farm project. In spite of the initial plan duration of 142 days and average duration of previous similar projects of 146 days, the project was completed in 113 days. Originality/value This paper introduces a practical project buffer and resource management model for project resource leveling, project buffer sizing and buffer consumption monitoring to reach a more realistic schedule in energy sector. This study adds to the literature by proposing the PBRM model in renewable energy sector.

No abstract

No abstract

No abstract

PurposeThe aim of this research is to propose a buffer sizing and buffer controlling algorithm (BSCA) as a heuristic algorithm for calculating project buffer and feeding buffers as well as dynamic controlling of buffer consumption in different phases of a wind power plant project in order to achieve a more realistic project duration.Design/methodology/approachThe BSCA algorithm has two main phases of planning and buffer sizing and construction and buffer consumption. Project buffer and feeding buffers are determined in the planning and buffer sizing phase, and their consumption is controlled in the construction and buffer consumption phase. The heuristic algorithm was coded and run in MATLAB software. The sensitivity analysis was conducted to show the BSCA influence on project implementation. Then, to evaluate the BSCA algorithm, inputs from this project were run through several algorithms recently presented by researchers. Finally, the data of 20 projects previously accomplished by the company were applied to compare the proposed algorithm.FindingsThe results show that BSCA heuristic algorithm outperformed the other algorithms as it shortened the projects' durations. The average project completion time using the BSCA algorithm was reduced by about 15% compared to the previous average project completion time.Originality/valueThe proposed BSCA algorithm determines both the project buffer and feeding buffers and simultaneously controls their consumption in a dynamic way.

Purpose The purpose of this paper is to introduce a reconfigurable model that is a combination of a schedule model and a queuing system M/M/m/K to reduce the duration of the wind turbine construction project closure phase and reduce the project documentation waiting time in the queue. Design/methodology/approach This research was implemented in a wind farm project. The schedule model deals with reducing the duration of the turbines closure phase by an activity overlapping technique, and the queuing system deals with reducing the turbine documentation waiting time in the queue, as well as reducing the probability of server idleness during the closure phase. Findings After the implementation of the model, the obtained results were compared to those of similar previously conducted projects in terms of duration, and the model was found effective. Research limitations/implications Project closure is an important and mandatory process in all projects. More often than not, this process is faced with problems including prolonged project duration, disputes, lawsuits, and also in projects like the implementation of wind farms, a queue of documents at closing stage may also cause difficulties in project closure phase. Originality/value The contributions of this research are twofold: first, a combination of project management and queuing system is presented, and second, a reconfigurable model is introduced to enhance the performance and productivity of the closure phase of the project through reducing the implementation time and reducing the turbine documentation waiting time in the queue, as well as reducing the probability of server idleness during the closure phase of the wind farm project.

Given the growing number of development projects, proper project planning and management are crucial. The purpose of this paper is to introduce a heuristic algorithm for scheduling a power plant project construction and project resource management to determine the size of project buffers and feeding buffers. This algorithm consists of three steps: 1. estimating the duration of project activities; 2. determining the size of the project buffer and feeding buffers; and 3. simulating the mentioned algorithm, which will be explained below. Innovations of this research are as follows: estimating the exact duration of project activities by using a heuristic algorithm, in addition to determining the buffer size; calculating both project buffer and feeding buffers; and applying the algorithm to implement an ACC used in combined cycle power plant projects as a numerical example. In order to evaluate the proposed algorithm, inputs from this project were run through several algorithms recently presented. The results showed that a suitable amount of buffers can be allocated for projects using this algorithm.