Multiproject Planning and Resource Controls for Facility Management

Facility managers face the challenges of managing many different types of small, geographically dispersed construction projects. Depending on the complexity and distribution of projects, the time required to prepare for production consumes a large percentage of the total time required to complete the job. Increasing crews’ productive hours is a key objective when planning multiproject schedules. Existing methods, however, lack the effective means to explicitly model, analyze, and optimize resource utilization for these multiple concurrent projects. As a result, few facility managers fully exploit the potential to better manage their often limited budget and resources. This paper presents an explicit model of the mobilization requirements of multiple crews performing a variety of different activities over a geographic space. The model allows the facility manager to explicitly investigate the impact of crew composition, crew specialization, and depot locations. Using work rule decisions regarding alternative crew allocations, facility managers may dynamically allocate resources to optimize resources and to complete projects in a minimum amount of time. To verify and validate this new model, a computerized system, called FIRS (Facility/Infrastructure Resource Scheduler), was created to analyze the multiproject resource plans with data from two military organizations and a university campus. FIRS utilizes a new genetic algorithm that was developed specifically to work with multiproject scheduling. Using FIRS, facility managers can develop and test alternative crew allocations based on the qualifications of the crews available and the type of operation being performed.     

Productivity Scheduling Method Compared to Linear and Repetitive Project Scheduling Methods

The analysis of project schedules is among the central tasks of construction managers. Parallel to the well-known critical path method, linear scheduling techniques have been researched. The two most fully developed existing methods, the linear scheduling model and the repetitive scheduling method, are reviewed. Based on a discussion of a published example, the new mathematical analysis method for linear and repetitive schedules is introduced. The productivity scheduling method is based on singularity functions that provide a flexible and powerful mathematical model for construction activities and their buffers that are characterized by their linear or repetitive nature. The steps of formulating initial equations, stacking and consolidating them, and deriving information about their criticality are described in detail. The mathematical approach of the new method allows an integrated treatment of activities regardless of the number of changes in productivity within them and does not depend on the graphical representation of the schedule.     

Linear versus Network Scheduling: A Critical Path Comparison

Linear scheduling methods provide an alternative way of scheduling repetitive projects, to the commonly used network methods. Critical path identification is a major attribute for both methods; therefore, it is very important for practitioners to understand the function of the two methods in this area. The present paper compares the critical path of the recently developed Kallantzis-Lambropoulos repetitive project model against the network scheduling critical path method (CPM), aiming at delving into and pointing out the differences and similarities between them. Initially, the rules for transforming the linear project into an equivalent CPM network are proposed. Then, the rules are applied on a sample linear project. Due to the additional constraint for maintaining resource continuity that the linear method takes into account, the critical paths vary. The constraint is subsequently removed from selected activities and comparison is repeated; the critical paths then coincide. In order to validate the findings and ensure impartiality of results, a random linear project generator is developed. A group of twenty-five random linear projects and their equivalent networks is produced. Their critical paths are analyzed, compared and classified. Conclusions support that the proposed comparison could be beneficial to users of linear scheduling methods, while the random project generator can serve other related research.     

Optimized Scheduling of Linear Projects

This paper presents a model, designed to optimize scheduling of linear projects. The model employs a two-state-variable, N-stage, dynamic programming formulation, coupled with a set of heuristic rules. The model is resource-driven, and incorporates both repetitive and nonrepetitive activities in the optimization process to generate practical and near-optimal schedules. The model optimizes either project construction duration, total cost, or their combined impact for what is known as cost-plus-time bidding, also referred to as A+B bidding. The model has a number of interesting and practical features. It supports multiple crews to work simultaneously on any activity, while accounting for: (1) multiple successors and predecessors with specified lead and lag times; (2) the impact of transverse obstructions, such as rivers and creeks, on crew assignments and associated time and cost; (3) the effect of inclement weather and learning curve on crew productivity; and (4) variations in quantities of work in repetitive activities from one unit to another. The model is implemented in a prototype software that operates in Windows? environment. It is developed utilizing object-oriented programming, and provides for automated data entry. Several graphical and tabular output reports can be generated. An example project, drawn from the literature, is analyzed to demonstrate the features of the developed model.     

Object-Oriented Model for Repetitive Construction Scheduling

This paper presents the development of an object-oriented model for scheduling of repetitive construction projects such as high-rise buildings, housing projects, highways, pipeline networks, bridges, tunnels, railways, airport runways, and water and sewer mains. The paper provides an overview of the analysis, design, and implementation stages of the developed object-oriented model. These stages are designed to provide an effective model for scheduling repetitive construction projects and to satisfy practical scheduling requirements. The model incorporates newly developed procedures for resource-driven scheduling of repetitive activities, optimization of repetitive construction scheduling, and integration of repetitive and nonrepetitive scheduling techniques. The model is named LSCHEDULER and is implemented as a windows application that supports user-friendly interface including menus, dialogue boxes, and windows. LSCHEDULER can be applied to perform regular scheduling as well as optimized scheduling. In optimized scheduling, the model can assist in identifying an optimum crew utilization option for each repetitive activity in the project that provides a minimum duration or cost for the scheduled repetitive construction project.     

Integrated Schedule and Cost Model for Repetitive Construction Process

Several efforts have been made by many researchers to develop a model for schedule and cost integration in construction projects, but it is difficult to integrate and manage schedule and cost in an actual construction site using such a model. The integrated schedule and cost model developed in this study (1) enables the planning and control of repetitive construction processes and (2) can be used by a project manager in an actual construction site. Furthermore, an integrated schedule and cost model for the core wall construction, which is an important repetitive process in the recently booming high-rise building construction in terms of scheduling, was developed using the integration model developed in this study. It is expected that the integrated schedule and cost model developed can allow project managers to integrate the schedule and cost of repetitive construction processes more effectively and support the project managers’ decision-making.     

Optimal Planning and Scheduling for Repetitive Construction Projects

This paper presents a multiobjective optimization model for the planning and scheduling of repetitive construction projects. The model enables construction planners to generate and evaluate optimal construction plans that minimize project duration and maximize crew work continuity, simultaneously. The computations in the present model are organized in three major modules: scheduling, optimization, and ranking modules. First, the scheduling module uses a resource-driven scheduling algorithm to develop practical schedules for repetitive construction projects. Second, the optimization module utilizes multiobjective genetic algorithms to search for and identify feasible construction plans that establish optimal tradeoffs between project duration and crew work continuity. Third, the ranking module uses multiattribute utility theory to rank the generated plans in order to facilitate the selection and execution of the best overall plan for the project being considered. An application example is analyzed to illustrate the use of the model demonstrate its new capabilities in optimizing the planning and scheduling of repetitive construction projects.     

Scheduling∕Cost Optimization and Neural Dynamics Model for Construction

A general mathematical formulation is presented for the scheduling of construction projects and is applied to the problem of highway construction scheduling. Repetitive and nonrepetitive tasks, work continuity constraints, multiple-crew strategies, and the effects of varying job conditions on the performance of a crew can be modeled. An optimization formulation is presented for the construction project scheduling problem, with the goal of minimizing the direct construction cost. The nonlinear optimization is then solved by the neural dynamics model developed recently by Adeli and Park. For any given construction duration, the model yields the optimum construction schedule for minimum construction cost automatically. By varying the construction duration, one can solve the cost-duration trade-off problem and obtain the global optimum schedule and the corresponding minimum construction cost. The new construction scheduling model provides the capabilities of both the critical path method (CPM) and linear scheduling method (LSM) approaches. In addition, it provides features desirable for repetitive projects, such as highway construction, and allows schedulers greater flexibility. It is particularly suitable for studying the effects of change order on the construction cost. This research provides the mathematical foundation for development of a new generation of more general, flexible, and accurate construction scheduling systems.     

Time-Cost Optimization of Construction Projects with Generalized Activity Constraints

Time-cost analysis is an important element of project scheduling, especially for lengthy and costly construction projects, as it evaluates alternative schedules and establishes an optimum one considering any project completion deadline. Existing methods for time-cost analysis have not adequately considered typical activity and project characteristics, such as generalized precedence relationships between activities, external time constraints, activity planning constraints, and bonuses/penalties for early/delayed project completion that would provide a more realistic representation of actual construction projects. The present work aims to incorporate such characteristics in the analysis and has developed two solution methods, an exact and an approximate one. The exact method utilizes a linear/integer programming model to provide the optimal project time-cost curve and the minimum cost schedule considering all activity time-cost alternatives together. The approximate method performs a progressive project length reduction providing a near-optimal project time-cost curve but it is faster than the exact method as it examines only certain activities at each stage. In addition, it can be easily incorporated in project scheduling software. Evaluation results indicate that both methods can effectively simulate the structure of construction projects, and their application is expected to provide time and cost savings.     

Linear Scheduling Model with Varying Production Rates

Activity production rates drive the development and accuracy of linear schedules. The nature of linear projects dictates an assortment of variables that affect each activity’s production rate. The purpose of this research was to expand the capabilities of linear scheduling to account for variance in production rates when and where the variance occurs and to enhance the visual capabilities of linear scheduling. This new linear scheduling model, a linear scheduling model with varying production rates (LSMVPR), has two objectives. The first is to outline a framework to apply changes in production rates when and where they occur along the horizontal alignment of the project. The second objective is to illustrate the difficulty or ease of construction through the time-location chart. This research showed that the changes in production rates because of time and location can be modeled for use in predicting future construction projects. Using the concept of working windows, LSMVPR allows the scheduler to develop schedule durations on the basis of minimal project information. The model also allows the scheduler to analyze the impact of various routes or start dates for construction and the corresponding impact on the schedule. The graphical format allows the construction team to visualize the obstacles in the project when and where they occur by using a new feature called the activity performance index (API). This index is used to shade the linear scheduling chart by time and location with the variation in color indicating the variance in predicted production rate from the desired production rate.     

Critical Path Scheduling under Resource Calendar Constraints

Resource calendars specify nonworking days of driving resources involved in construction projects. As part of the resource availability constraints in critical path method (CPM) scheduling, resource calendars may postpone activity start time, extend activity duration, and hence prolong the total project duration. Ultimately, resource calendars bring about changes to the critical path identification. Research has yet to address how to incorporate the effects of multiple resource calendars on the total float determination. In this research, the popular P3 software is used as a tool for investigating the current practice of CPM scheduling under resource limit and calendar constraints. We assess P3’s advanced resource scheduling functions (including resource leveling and resource calendars) and identify P3’s potential errors in total float determination. Further, we propose a new method based on the forward pass analysis alone for accurately evaluating activity total float subject to resource calendar constraints. The application of the new method is illustrated with an activity-on-node case and a precedence-diagram-method case, with the results compared against those produced from P3. Our research has elucidated on some critical issues of resource-constrained scheduling in the application domain of construction project management. The findings will provide useful input for the vendors and users of the CPM software—which is not limited to P3—to improve the scheduling methodology as well as the accuracy of the resulting project schedules.     

GA-Based Multicriteria Optimal Model for Construction Scheduling

Resources for construction activities are limited in the real construction world. To avoid the waste and shortage of resources on a construction jobsite, scheduling must include resource allocation. A multicriteria computational optimal scheduling model, which integrates the time∕cost trade-off model, resource-limited model, and resource leveling model, is proposed. A searching technique using genetic algorithms (GAs) is adopted in the model. Furthermore, the nondominated solutions are found by the multiple attribute decision-making method, technique for order preference by similarity to ideal solution. The model can effectively provide the optimal combination of construction durations, resource amounts, minimum direct project costs, and minimum project duration under the constraint of limited resources.     

Finance-Based Scheduling of Construction Projects Using Integer Programming

Construction scheduling is the process of devising schemes for sequencing activities. A realistic schedule fulfills the real concerns of users, thus minimizing the chances of schedule failure. The minimization of total project duration has been the concept underlying critical-path method/program evaluation and review technique (CPM/PERT) schedules. Subsequently, techniques including resource management and time-cost trade-off analysis were developed to customize CPM/PERT schedules in order to fulfill users’ concerns regarding project resources, cost, and time. However, financing construction activities throughout the course of the project is another crucial concern that must be properly treated otherwise, nonrealistic schedules are to be anticipated. Unless contractors manage to procure adequate cash to keep construction work running according to schedule, the pace of work will definitely be relaxed. Therefore, always keeping scheduled activities in balance with available cash is a potential contribution to producing realistic schedules. This paper introduces an integer-programming finance-based scheduling method to produce financially feasible schedules that balance the financing requirements of activities at any period with the cash available during that same period. The proposed method offers twofold benefits of minimizing total project duration and fulfilling finance availability constraints.     

Productivity Scheduling Method: Linear Schedule Analysis with Singularity Functions

This paper describes a new integrated method of linear schedule analysis using singularity functions. These functions have previously been used for structural analysis and are newly applied to scheduling. Linear schedules combine information on time and amount of work for each activity. A general model is presented with which activities and their buffers can be mathematically described in detail. The algorithm of the new method forms the body of the paper, including the steps of setting up initial equations, calculating pairwise differences between them, differentiating these to obtain the location of any minima, and deriving the final equations. The algorithm consolidates the linear schedule under consideration of all constraints and, thus, automatically generates the minimum overall project duration. The model distinguishes time and amount buffers, which bears implications for the definition and derivation of the critical path. Future research work will address float and resource analysis using the new model.     

Non-Unit-Based Planning and Scheduling of Repetitive Construction Projects

Repetitive scheduling methods are more effective than traditional critical path methods in the planning and scheduling of repetitive construction projects. Nevertheless, almost all the repetitive scheduling methods developed so far have been based on the premise that a repetitive project is comprised of many identical production units. In this research a non-unit-based algorithm for the planning and scheduling of repetitive projects is developed. Instead of repetitive production units, repetitive or similar activity groups are identified and employed for scheduling. The algorithm takes into consideration: (1) the logical relationship of activity groups in a repetitive project; (2) the usage of various resource crews in an activity group; (3) the maintaining of resource continuity; and (4) the time and cost for the routing of resource crews. A sample case study and a case study of a sewer system project are conducted to validate the algorithm, as well as to demonstrate its application. Results and findings are reported.     

Cost Optimization in Projects with Repetitive Nonserial Activities

A practical model for scheduling and cost optimization of repetitive projects is proposed in this paper. The model objective is to minimize total construction cost comprising direct cost, indirect cost, interruption cost, as well as incentives and liquidated damages. The novelty of this model stems from four main aspects: (1) it is based on full integration of the critical path and the line of balance methodologies, thus considering crew synchronization and work continuity among nonserial activities; (2) it performs time-cost trade-off analysis considering a specified deadline and alternative construction methods with associated time, cost, and crew options; (3) it is developed as a spreadsheet template that is transparent and easy to use; and (4) it utilizes a nontraditional optimization technique, genetic algorithms, to determine the optimum combination of construction methods, number of crews, and interruptions for each repetitive activity. To automate the model, macroprograms were developed to integrate it with commercial scheduling software. Details of the model are presented, and an example project is used to demonstrate its benefits.     

Work Continuity Constraints in Project Scheduling

Repetitive projects involve the repetition of activities along the stages of the project. Since the resources required to perform these activities move from one stage to the other, a main objective of scheduling these projects is to maintain the continuity of work of these resources so as to minimize the idle time of resources. This requirement, often referred to as work continuity constraints, involves a tradeoff between total project duration and the resource idle time. The contribution of this paper is threefold. First, we provide an extensive literature summary of the topic under study. Although most research papers deal with the scheduling of construction projects, we show that this can be extended to many other environments. Second, we propose an exact search procedure for scheduling repetitive projects with work continuity constraints. This algorithm iteratively shifts repeating activities further in time in order to decrease the resource idle time. We have embedded this recursive search procedure in a horizon-varying algorithm in order to detect the complete tradeoff profile between resource idle time and project duration. The procedure has been coded in Visual C++ and has been validated on a randomly generated problem set. Finally, we illustrate the concepts on three examples. First, the use of our new algorithm is illustrated on a small fictive problem example from literature. In a second example, we show that work continuity constraints involve a tradeoff between total project duration and the resource idle time. A last example describes the scheduling of a well-known real-life project that aims at the construction of a tunnel at the Westerschelde in The Netherlands.     

System of Multiple ANNs for Online Planning of Numerous Building Improvements

The aging infrastructure in North America and worldwide mandates large investments in repair and improvement (R&I) activities. For organizations that own many assets, managing a large number of R&I activities is not a simple task and requires accurate estimating and scheduling so that proper budgeting and resource allocation decisions can be made. To support these decisions, this paper introduces a Web-based system that estimates the cost and duration of a user-requested R&I activity and provides alternative schedules based on resource availability. For estimating, the Web-based system hosts 32 artificial neural networks (ANNs), trained on actual historical data, for 32 common R&I activities in building projects. Each ANN incorporates a sensitivity analysis to consider the uncertainty in the input parameters on the estimate, and is linked to a central scheduling algorithm for resource allocation based on a first-come first-serve basis. The automated system helps practitioners in planning numerous R&I requests with least time, cost, and paper work. Details on system development are provided in this paper along with perceived benefits and the opinion of users on its performance.     

Investigating the Effectiveness of Certain Priority Rules on Resource Scheduling of Housing Estate Projects

The heuristic method is one of the methods used for the scheduling of resource-constrained projects. This method is commonly used in programming the projects with high number of activities and resources such as construction investments. This paper investigates the effectiveness of three heuristic method priority rules applied in the resource scheduling of ten Turkish housing estate projects which were scheduled according to three preselected priority rules [maximum remaining path length (MRPL), latest finish time (LFT), and minimum slack time (MNSLCK)] in resource-constrained conditions. The performance of each priority rule was evaluated in relation to the duration of the project. The results revealed that MRPL priority reduced the project duration to minimum in six projects, whereas LFT priority yielded the best duration results in three projects and MNSLCK priority in only one project.     

Algorithm for Determining Controlling Path Considering Resource Continuity

Scheduling of construction projects that have multiple units, wherein activities repeat from one unit to another, always represent a major challenge to project managers. These projects require schedules that ensure the uninterrupted usage of resources from an activity in one unit to the similar activity in the next unit and maintaining logic constraints at the same time. The scheduling method presented in this paper considers both logic and resource continuity constraints. The method utilizes the critical path method network of a single unit. Start-to-start and finish-to-finish relationships are used. Constant activity production rate is assumed. The proposed approach determines the controlling path (logically and resource critical units) in a simplified way. To automate the proposed algorithm, a macroprogram has been written on commercial scheduling software. Details of the model development and implementation are described, and an example application is presented to validate the proposed approach. The advantages, limitations, and future extensions of the proposed approach are then discussed.