UBC Theses and Dissertations

UBC Theses Logo

UBC Theses and Dissertations

Resource leveling and linear scheduling Dubey, Ashish 1993

Your browser doesn't seem to have a PDF viewer, please download the PDF to view this item.

Item Metadata

Download

Media
831-ubc_1993_fall_dubey_ashish.pdf [ 11.53MB ]
Metadata
JSON: 831-1.0050448.json
JSON-LD: 831-1.0050448-ld.json
RDF/XML (Pretty): 831-1.0050448-rdf.xml
RDF/JSON: 831-1.0050448-rdf.json
Turtle: 831-1.0050448-turtle.txt
N-Triples: 831-1.0050448-rdf-ntriples.txt
Original Record: 831-1.0050448-source.json
Full Text
831-1.0050448-fulltext.txt
Citation
831-1.0050448.ris

Full Text

RESOURCE LEVELING AND LINEAR SCHEDULING  by  ASHISH DUBEY  A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF APPLIED SCIENCE in THE FACULTY OF GRADUATE STUDIES DEPARTMENT OF CIVIL ENGINEERING  We accept this thesis as conforming to the required standard  THE UNIVERSITY OF BRITISH COLUMBIA 30 APRIL 1993  ASHISH DUBEY, 1993  In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the Head of my Department or by his or her representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission.  Department of Civil Engineering The University of British Columbia 2324 Main Mall Vancouver, Canada V6T 1Z4 Date: 30 April 1993  ABSTRACT  Resource leveling in the context of linear scheduling has been explored in this thesis. Multilocation projects such as high rise construction, bridges and so forth have special characteristics which should be taken into account in resource leveling procedures - e.g., flow line characteristics should be maintained or a specified location execution sequence must be followed.  The Minimum Moment Algorithm for resource leveling by Harris has been used as a starting point to develop a modified algorithm to treat linear scheduling. Further modifications have been made to accommodate activities with variable resource usage profiles. The new algorithm has been named the "Modified Minimum Moment Algorithm".  The research version of the REPCON Construction management information System has been used for the testing of the algorithm. The multilocation activity modeling structures of REPCON have been used to define linear activity types. One constraint on the leveling algorithm is that these activity types must maintain their attributes when subjected to leveling, e.g., a continuous activity must maintain free float equal to zero between its intermediate locations and the ordered activity must follow the specified location sequence.  The algorithm has been programmed and tested on several examples. Resource histograms  ii  TABLE OF CONTENTS  Abstract ^  ii  List of Tables ^  vii  List of Figures ^  viii  Acknowledgements ^  xii  1  2  3  Introduction ^  1  1.1  Objectives ^  1  1.2  Methodology ^  2  Linear Scheduling ^  4  2.1  Introduction ^  4  2.2  The Linear Scheduling Method ^  4  2.3  Linear Scheduling and Resource Leveling ^  9  2.4  Resource Modeling in REPCON ^  15  Review of Resource Leveling Literature ^  19  3.1  Introduction ^  19  3.2  Burgess and Killebrew ^  19  iv  3.3^Burman ^  21  3.4^Levy, Thompson and Weist ^  22  3.5^Harris ^  25  3.6^Easa ^  31  3.7^Antill and Woodhead ^  34  3.8^Davis ^  39  3.9 Summary ^  40  4^Modified Minimum Moment Algorithm ^  4.1^Introduction  41  41  4.2^The Minimum Moment Algorithm: An Introduction ^ 41 4.3^The Concept of Improvement Factor ^  44  4.3.1 Improvement Factor for Activities with Constant Resource Usage ^  45  4.3.2 Improvement Factor for Activities with Variable Resource Usage ^  50  4.4^The Concept of Back Float ^  64  4.5^Sequence Step Numbers ^  67  4.6^Weighting Scheme for Resources ^  68  4.7 A Brief Review of the Harris Minimum Moment Algorithm ^ 69 4.8^Refinements and Modifications to the Basic Minimum Moment Algorithm for Linear Scheduling and Variable Resource Usage ^  v  73  4.9^The Modified Minimum Moment Algorithm for Resource Leveling ^ 75 4.9.1 Modified Minimum Moment Algorithm for Problems involving Activities with Constant Resource Usage ^ 77 4.9.2 Modified Minimum Moment Algorithm for Problems involving Activities with Variable Resource Usage ^ 83  5^Examples ^  88  6^Conclusion and Recommendations ^  141  Bibliography ^  144  Appendix A ^  A-1  Appendix B ^  B-1  Appendix C ^  C-1  Appendix D ^  D-1  Appendix E ^  E-1  Appendix F ^  F-1  Appendix G ^  G-1  Appendix H ^  H-1  Appendix I ^  I-1  Appendix J ^  J-1  Appendix K ^  K-1  vi  LIST OF TABLES  2.1  Project Schedule from REPCON reporting system (for the example in Figure 2.4) ^  13  2.2  Classification of Resources; Battersby (7) ^  15  2.3  A tabular resource usage report from REPCON ^  17  3.1  Resource levels before and after leveling (Burman) ^ 24  3.2  Resource levels before and after leveling (Packing Method) ^ 29  3.3  Resource levels before and after leveling (Easa) ^ 34  3.4  Resource levels before and after leveling (Antill & Woodhead) ^.  36  List of Figures  2.1  Linear Planning Chart ^  2.2  Linear planning chart for an activity with one crew ^  2.3  6  8  Linear Planning chart for the same activity but with three crews ^  8  2.4  Major activity types in REPCON ^  11  2.5  Linear Planning Chart from REPCON reporting system (for the example in Figure 2.4 ^  14  2.6  General resource usage profile for an activity ^  16  3.1  Network and Schedule for Burman's example; Burman (10) ^ 22  3.2  Resource histograms before and after leveling; Burman (10) ^ 23  3.3  Network and Schedule for Harris Packing Method; Harris (23) ^ 28  3.4  Resource histograms before and after leveling; Harris (23) ^ 30  3.5  Network and schedule for Easa's example; Easa (18) ^  3.6  Resource histograms before and after leveling (Uniform histogram criteria); Easa (18) ^  3.7  31  33  Resource histograms before and after leveling (Min. daily resource variation criteria); Easa (18) ^  viii  33  3.8  Network and schedule for Antill & Woodhead's example; Antill & Woodhead (3) ^  3.9  35  Resource levels before and after leveling- Manpower; A & W (3) ^ 37  3.10 Resource levels before and after leveling- Equipment A; A & W(3) ^ 37 3.11  Resource levels before and after leveling- Equipment B; A & W(3) ^ 38  4.1  Shifting activity with constant resource rate (S __ T) ^  4.2  Shifting activity with variable resource usage profi6le (S < T) ^ 52  4.3  Shifting activity with variable resource usage profile ^  5.1  Resource histograms before and after leveling - example 5.1 ^ 90  5.2  Resource histograms before and after leveling - example 5.2 ^ 92  5.3  Resource histograms before and after leveling - example 5.3 ^ 94  5.4  Resource histograms before and after leveling - example 5.4 ^ 96  5.5  Network for resource leveling with two resources - example 5.5 ^ 99  5.6  Resource histograms before and after leveling - Res. 1; example 5.5 ^ 100  5.7  Resource histograms before and after leveling - Res 2; example 5.5 ^ 101  5.8  Resource histograms before and after leveling - Res 1 +Res 2; example 5.5 ^ 102  5.9  Network for resource leveling; (Clough and Sears example) ^ 104  5.10  Resource histograms before and after leveling; example 5.10 (Modified Minimum Moment algorithm) ^  5.11  46  59  105  Resource leveling before and after leveling; example 5.10 (Cloughs and Sears approach) ^  5.12 Network for resource leveling; example 5.7 ^  ix  106 109  5.13  Manual resource leveling computations for example 5.7 ^  5.14  Resource histograms before and after leveling; example 5.7 ^ 111  5.15  Linear planning chart for early start schedule; example 5.7 ^ 112  5.16  Linear planning chart for late start schedule; example 5.7 ^ 113  110  5.17 Linear planning chart for leveled schedule; example 5.7 ^ 114 5.18  Manual resource leveling computations for example 5.8 ^ 117  5.19 Resource histograms before and after leveling; example 5.8 ^ 118 5.20 Linear planning chart for early start schedule; example 5.8 ^ 119 5.21  Linear planning chart for leveled schedule; example 5.8 ^ 120  5.22 Linear planning chart for late start schedule 5.8 ^  121  5.23  Network for resource leveling with two resources; example 5.9 ^ 123  5.24  Resource histograms before and after leveling - Resource 1; example 5.9 ^ 124  5.25  Resource histograms before and after leveling - Resource 2; example 5.9 ^ 125  5.26  Resource histograms: leveled and early start; example 5.10 ^ 128  5.27  Resource histograms: leveled and late start; example 5.10 ^ 129  5.28 Linear planning chart for early start schedule; example 5.10 ^ 130 5.29 Linear planning chart for late start schedule; example 5.10 ^ 131 5.30  Linear planning chart for resource leveled schedule; example 5.10 ^ 132  5.31  Linear planning chart for resource leveled schedule; example 5.10 (after four iterations)  ^  133  5.32 Resource histograms: leveled and early start; example 5.11 ^ 136 5.33  Resource histograms: leveled and late start; example 5.11 ^ 137  x  5.34 Linear planning chart for early start schedule; example 5.11 ^ 138 5.35 Linear planning chart for late start schedule; example 5.11 ^ 139 5.36 Linear planning chart for leveled schedule; example 5.11 ^ 140  )d  ACKNOWLEDGEMENTS  I express my sincere gratitude to Dr. A. D. Russell, for his guidance during the course of this study. I greatly appreciate his efforts and time in reviewing this thesis and the valuable suggestions to improve the content. My thanks are extended to Dr. W. F. Caselton and Dr. T. M. Froese for reviewing this thesis.  xii  Chapter 1 INTRODUCTION  1.1 OBJECTIVES The primary objective of this thesis is to explore resource leveling in the context of linear scheduling. Multilocation activities (as found in repetitive construction) require special consideration in resource leveling operations. For example, if it is desired to have multilocation activities exhibit flow line characteristic or to follow a given location sequence, then in the leveled schedule these attributes should be reflected in the respective activities. Therefore, the objective is to produce a leveling procedure that is applicable to linear scheduling. The second objective of this thesis is that the leveling procedure must have the capability to handle activities with both constant and variable resource usage over their durations. The leveling procedure should also be able to deal with multiple resources.  As a first step, an overview of linear scheduling and resource leveling is presented in chapter 2. As the next step, various leveling procedures currently available in the literature have been investigated and their review is presented in chapter 3. The Minimum Moment Algorithm for resource leveling by Harris (22) has been reviewed in chapter 4 and has been taken as the starting point for further development to accomplish the objectives of this thesis. Thus in this thesis the concept of Minimum Moment Algorithm has been developed further to enhance its ability to deal with a wider variety of problems including Linear Scheduling. The modified and extended Minimum Moment Algorithm for resource leveling  Chapter I. Introduction^  2  has been named the "Modified Minimum Moment Algorithm".  1.2 METHODOLOGY  The basic Minimum Moment Algorithm assumes that activities have a constant resource usage rate over their durations. The algorithm has been extended to treat activities with variable resource usage profiles. This objective has been achieved by formulating an expression for the computation of "Improvement Factors" for activities with variable resource usage profiles. This expression has been derived in chapter 4.  The research version of the REPCON Construction Management Information System, which includes an implementation of linear scheduling, has been used as a test bed for the algorithm developed in this thesis.  Linear Scheduling in REPCON is accomplished through its activity modeling structures which are specially designed for this purpose. Shadow, Ordered and Continuous activity types form the foundation and body of these modeling structures. Each of these activity types has its own attributes. It is important while shifting a multilocation activity for the purpose of resource leveling, that it maintain its attributes, e.g., flow line behaviour must be maintained, the free float must remain zero for the intermediate locations of a continuous activity, and the individual locations of an ordered activity must follow the specified location execution sequence. Thus, each of these activity types should be treated differently when shifting them. This issue has been addressed in the algorithm proposed.  Chapter I. Introduction^  3  The algorithm has been programmed in the C programming language. It has been applied to a number of examples for validation purposes and to explore the behaviour of linear schedules that are subject to resource leveling. For the former, several examples correspond to ones found in the literature, although no linear scheduling examples were found. For the latter, manual resource leveling computations have been worked out for two linear scheduling examples to verify the accuracy of the computer code. Other larger scale linear planning example are also included to explore the behavior of resource leveling as applied to linear scheduling.  Chapter 2  +  LINEAR SCHEDULING  2.1 INTRODUCTION The primary purpose of this thesis is to explore resource leveling as it applies to linear scheduling. The linear planning chart is a very powerful way of presenting schedules for projects which are repetitive or cyclic in nature. Its importance increases when it is used to analyze the movement of crews and resources from one location to another. Therefore, it is a very direct way of assessing how efficiently resources are being utilized in a project. Description of traditional scheduling methods like bar chart and network analysis have appeared many times in the literature [Antill (3), Fondahl (20), Kelley (27), Moder (32)], but the linear scheduling method still is not well understood. The purpose of this chapter is to provide a brief explanation of the linear scheduling method in order to develop a clear understanding of it and then relate it to REPCON (see section 2.3) for the purpose of resource modeling and leveling.  2.2 THE LINEAR SCHEDULING METHOD Linear scheduling method is best suited for those type of projects which involve the repetition of activities such as in road construction, tunnelling operations, high-rise building construction or pipeline works. But what makes CPM scheduling undesirable for repetitive projects? In his paper, Carr (13) identifies two criteria to be met by a project in order that CPM scheduling may be applied successfully:  Chapter 2. Linear Scheduling^  5  1)  The number of activities is commensurate with the complexity of the project; and  2)  The activities have clear dependencies which define the progress required through to project completion.  For many projects with repetitive activities, the first criterion does not apply. The quantum of activities involved is often very large and the resulting network turns out to be very complex in contrast to the simple unit network.  The second condition may not be fulfilled for repetitive construction because in many cases it is hard to justify the dependencies between the activities of one unit and another. In theory, any unit may succeed the ongoing one if the non-construction restraints are relaxed. However, many of the relationships between units flow from logistical considerations which can have a significant influence on overall productivity. Thus the order in which work may flow from one unit to another is highly variable and depends on management decisions rather than any logical relationship amongst activities between units. Thus, these reasons make CPM scheduling and monitoring awkward for treating repetitive operations.  In the linear scheduling method, the schedule is presented in the form of a linear planning chart. The linear planning chart consists of two axes, one for time and the other for location (or distance or unit number, etc.). The activities are plotted against these two axes. An activity may have a constant slope over all locations meaning that the production rate remains constant, i.e., each location takes the same amount of time for execution. If the  6  Chapter 2. Linear Scheduling^  slope changes, then work is not progressing at the same rate at different locations. If the line is not continuous, then work interruptions occur between locations, and the crews are not getting continuous work for that activity. An example linear planning chart is shown in Figure 2.1. It shows a construction project involving 8 activities in each location with a total of 5 locations requiring 86 days for project completion. The activities "clear and grade site" and "lay blocks" are examples of activities with a constant rate of production. For activity "deliver blocks", the production rate changes from location to location. For activities "layout footings" and "dig footings", work interruptions occur between locations signifying that crews are not getting continuous work. 5  4  2  1 10^20^30^40^50 Time (days)  ^  60  ^ ^ ^90 70 80  Figure 2.1 Linear planning chart Properly planning repetitive work will significantly improve on work productivity and thus on cost. With the objectives of maintaining a constant and continuous rate of work for any  Chapter 2. Linear Scheduling ^  7  repetitive activity, resources (equipment, labor, etc.) can be mobilized efficiently with little or no idle time. Also, hiring and firing situations which are typical of unplanned and nonrepetitive works are minimized. In addition, significant increases in productivity may be gained by learning curve effects while work progresses from location to location.  In their paper, Arditi and Albulak (5) define the "natural rhythm" as the optimum rate of output for any activity that a crew of optimum size can produce. Examples of this could be expressed as number of locations completed per day per crew or number of units made per day per crew. If the actual production rate of crews being used is not an exact multiple of the natural rhythm then there will be periods of inactivity for the respective crews from time to time over the project duration. Therefore, the need arises of employing and deploying the number of crews in such a way that their rate of production (a multiple of natural rhythm) matches the required rate of production. For example, for a repetitive activity, considering its logical relationship with other activities, if the required rate of production is 9 locations per day and the natural rhythm of the crew is 3 locations per day then the number of crews needed will be 3. The above can be illustrated through the example shown in Figure 2.2. Suppose the natural rhythm for an activity is 3 locations per day and the number of crews employed is 1, then the actual rate of production will be 3 locations per day as shown in Figure 2.2. If the number of crews is increased to 3 then the actual rate of production would increase to 9 locations per day as shown in Figure 2.3.  Chapter 2. Linear Scheduling^  crew 1  9  crew 1  7 Crew  6 c 0 5 1  I  crew 1  8  J —I  8  crew 1 crew  4 crew  3 2  crew 1  1  crew 1 0  1  ^ ^ 2 3 Time, t in days  Figure 2.2 Linear planning chart for an activity with one crew Actual rate of production is 3 locations/day  0  ^^ 1 2^3^4 Time, t in days Figure 2.3 Linear planning chart for the same activity but with three crews Actual rate of production is 9 locations/day  4  Chapter 2. Linear Scheduling ^  9  The other major advantages derived from the linear scheduling method are as follows. The simple way in which the linear planning chart conveys detailed information aids site personnel to execute the work in an efficient manner without being loaded down by excess numerical data as often happens in traditional CPM network scheduling. Project monitoring using the linear planning chart while work is in progress can be very convenient and intelligible. It is quite easy for the project manager and other site personnel to analyze, understand and appreciate the linear planning chart and then to implement the work accordingly or to suggest any changes if need be. Using the linear planning chart, it is easy to know the resource spreadout over the project duration. If resource buildup occurs at certain periods over the project duration then the corresponding activities may be shifted in their float period in order to get a leveled resource profile for the project. Thus the objectives of smooth flow of work and smooth consumption of resources can be achieved by making necessary changes in the linear planning chart.  2.3 LINEAR SCHEDULING AND RESOURCE LEVELING To date, the only known mathematically based and computerized implementation of linear scheduling has been developed by Russell (39) and Russell and Wong (40). No references have been found in the literature dealing with the topic of resource leveling in the context of linear scheduling. Hence, the goal of this thesis is to address this topic. The research version of the REPCON Construction Management Information System has been used as an environment for testing a leveling algorithm. This approach has allowed me to take advantage of the activity modeling structures and reporting capabilities of REPCON. Here,  Chapter 2. Linear Scheduling^  10  I describe briefly the modelling structures and give a simple example which is used later in  the resource leveling work. The major activity types which may be defined in REPCON are: 1) Ordered activity, 2) Continuous activity, 3) Shadow activity, and 4) Hammock activity.  Management may preassign a certain location sequence that an activity must follow as work progresses, although interruptions are permitted. Such an activity can be treated using the ordered activity type. This activity type is also used for modeling cyclic work patterns - e.g.,  for two activities A and B, B at location i is a successor to A at location i, and B at location i is a predecessor to A at location i+1. A continuous activity type is used to ensure a  continuous flow of work from location to location without involving any interruption in time, unless specified. For the multi-location activity for which the location sequence is unimportant the shadow activity type is used. The hammock activity type is used to span several activities - its production rate is determined from its predecessor and successor relationships.  We illustrate the use of these activity types through a simple example shown in Figure 2.4. The example consists of 6 activities. Activity number 1 is the start milestone. The second activity A is a shadow activity which occurs at 4 locations. It can be represented by activities A 1 , A2, A3, and A 4 at locations 1, 2, 3, and 4, respectively, to correspond to a traditional  early start date  Critical path Continuous activity  early finish date  17 21 location  B4  12  4  10  activity number  duration^number of resources Sample activity A  6  5 10  0  0  Start  1  0 0  4 10  0[5  27 133  A2 I 3  C4115  5 10  6 1 10  5  21  25  4  D1  11 ^  D2  14  Rash  16  10  4  10  4  10  0  0  [ , A2 , A 3 , A 4 ] — Shadow activity  0 5  -1110- 33 33  17 [ 21  10  [ B1 , B 2 , B 3 , B 4] -- Ordered activity  [ c,  ,  C2 , C3, C4 — Ordered activity  [ D t , 02 ] — Continuous activity  Figure 2.4 Major activity types in REPCON I.  Chapter 2. Linear Scheduling^  12  CPM representation. The third activity, activity B, is an ordered activity occurring at 4 locations - B1, B2, B3, and B4 at locations 1, 2, 3, and 4, respectively. The fourth activity, activity C, is also an ordered activity occurring at 4 locations - C 1 , C2, C3 , and C4 at locations 1, 2, 3, and 4, respectively. The fifth activity, activity D, is a continuous activity which occurs at locations - D 1 and D2 at locations 1 and 2, respectively. The sixth activity is a finish milestone. Table 2.1 shows the project schedule and Figure 2.5 shows the Linear Planning Chart for early start schedule as presented by the REPCON reporting system. Activity numbers have been assigned to each location of an activity in Figure 2.4 - e.g., A3 corresponds to activity 4.  Resource leveling is accomplished by shifting activities in their float periods. Usually, shadow activities have a fair amount of float associated with them making them a good candidate for shifting. For a continuous activity, all its locations move as an unit. Therefore, the intermediate locations of a continuous activity are not independent and are devoid of free floats. Thus the shifting and leveling of a continuous activity as a whole is possible only when its last location has positive float. Individual locations of an ordered activity will always have some float time associated with them if they are not critical. Thus the ordered activities are also candidates for shifting and leveling operations.  It should be noted that projects amenable to flow line modeling loose potential for resource leveling because flow lines tend to limit the amount of float. For a continuous activity, the next location must follow the ongoing one immediately upon its completion.  Table 2.1 Project schedule from REPCON reporting system (for the example in Figure 2.4)  UBC CONSTRUCTION MANAGEMENT LAB Major Activi ty Types in Repcon — Chapter 2 File Used: D:\REP200\PROJ19\TWO^ Revision No:^0^ Select: All activities^ Sort: by Activity Code^ ACTIVITY CODE^DESCRIPTION * G00100 Activity A G00100 Activity A G00100 Activity A G00100 Activity A * G00200 Activity B G00200 Activity B 600200 Activity B G00200 Activity B * G00300 Activity C * G00300 Activity C N G00300 Activity C * G00300 Activity C G00400 Activity D G80400 Activity D * G00500 Project Start N G00600 Project Finish  LOCATION LOC^DESCRIPTION 1 Location 1 2 Location 2 3 Location 3 4 Location 4 1 Location 1 2 Location 2 3 Location 3 4 Location 4 1 Location 1 2 Location 2 3 Location 3 4 Location 4 1 Location 1 2 Location 2 1 Location 1 4 Location 4  LIST OF DATES  + ^ Report Date: 24APR93 I * critical activity^P activity has procurement sequence ^ Report Tine: 11:52:20 ZT percent time^II estimated actual Finish, float and duration I^ Progress Date: -None4 ^ Schedule Window: Fran 01MAR93 To 02APR93 Page 1 EARLY^LATE^SCHEDULED^ACTUAL^SCHED^ACT.^TOTAL^EXTRA START^FINISH^START^FINISH^START^FINISH^START^FINISH^DUB^DUB^FLOAT^FLOAT 011WI93 05MAR93 010111193 05MAR93 01MAR93 05MAR93 07MAR93 11MAR93 01MAR93 05MAR93 13MAR93 17MAR93 01MAR93 05MAR93 19MAR93 23MAR93 06MAR93 09MAR93 06MAR93 09MAR93 10MAR93 13t 1193 12MAR93 15MAR93 14MAR93 17MAR93 18MAR93 21MAR93 111MAI193 21MAR93 24MAR93 27MAR93 10MAR93 15MAR93 10MAR93 15MAR93 16MAR93 21MAR93 16MAR93 21MAR93 22MAR93 27MAR93 22MAR93 27MA893 28MAR93 02APR93 20MAR93 02APR93 1EIMAII93 21M11893 26MAR93 29MAR93 2711AR93 25MAA93 30MAR93 02APR93 OZAPR93^O2APR93  01MAR93  5 5 5 5 4 4 4 4 6 6 6 6 4 4 N/A [02APR93] N/A  1 1  NI N/  N/  1  N/A N/A N/A 1 N/A 1 N/A N/A N/A N/A N/A N/A N/A N/A 0 0 N/A N/ N/A^I I  N/A N/A N/A N/A N/A N/A N/A N/A N/A N/A N/A N/A 0 0 N/A N/A  UBC CONSTRUCTION MANAGEMENT LAB  u ,011.  REPCON— Major Activity Types in Repcon — Chapter 2 Page 2 U 2 ^  File Used 0 \REP200\PROJ19\TWO LINEAR PLANNING CHART ACTIVITY INDEX Select . All Activities Sort'^Start Date Date Selection' Act/Sch/Early Schedule Window Time: 01MAR93 To 02APR93 Locations:^1 To^4  1  Col c) c„o  KEY^w Critical Activity^p Activity has procurement sequence Code Type Description G00500 SM Project Start M^  N  Report Date:^24APR93 Report Time:^11:49:17 Progress Date: Revision Number: 0  2O000100 S Activity A  A  c Completed^Activity Types: 0 Ordered, C Continuous, S Shadow, H Hammock, SM Start Milestone, FM Finish Milestone Code Type Description G00200^0 Activity B  Code Type Description 0 G00400 C Activity D  G00300^0 Activity C  ® GOOBOO FM Project Finish  Comment:  LOCN  DESCRIPTION Ei  4  Location 4  3  Location 3  2  Location 2  1  Location 1  --—  _-----"_,-----"-  F  1993 MARCH 15^22  ' .  3  .  .............„......„„..../."  A 29  _.------17 ,  (5------------74^5  ........---------  8  15^22 MARCH 1993  29 A  Figure 2.5 Linear Planning Chart from REPCON reporting system (for the example in Figure 2.4) I.  15  Chapter 2. Linear Scheduling^  Therefore, for the intermediate locations of a continuous activity, float is reduced to zero, leaving no scope for them to get shifted independently. The individual locations of ordered activity may have floats associated with them. However, the mutual interdependency of individual locations of the ordered activity and the condition imposed on them that they follow a given location execution sequence tends to limit the associated floats. Thus, the flow lines by themselves tend to spread the resources over time, but simultaneously they reduce the further shifting and reshifting opportunities of activities by limiting their float times.  2.4 RESOURCE MODELING IN REPCON Table 2.2 adopted from Battersby (7) gives one classification of the major types of resources which a project planner is likely to consider. Four major classes of resources have been Table 2.2 Classification of Resources; Battersby (7) Difficult to evaluate  Money as a common measure Men Unskilled^Semi-^Skilled skilled  Machines  On day work, overtime, bonus work or shift work  Miscellaneous Space  Direct^Service  Returnable and nonreturnable  Casual^Permanent^Trades, departments or other distinctions Mobile or restricted to one location  Material  Owned or hired Capital  Artificial, e.g., safety, time restrictions, location  ^  16  Chapter 2. Linear Scheduling ^  identified and are subsequently divided into subclasses. Major class of resources are: 1)  Men,  2)  Machines,  3)  Materials, and  4)  Miscellaneous.  This classification is given only to enhance the understanding on the issue of resource types and is not unique.  30 >. 25 RS 20 _ 0  a) m 15 —  10 5  4^6^8^10^12^14^16^18^20^22^24^26^28 I  I^  I^  I  I^  1^I  1 A 3^A4  I ^  A l^A 2^ Location and Duration  Figure 2.6 General resource usage profile for an activity  To support the work described in this thesis, a reasonably rich resource modeling capability was incorporated into the experimental version of REPCON. A resource can belong to a  Table 2.3 A tabular resource usage report from REPCON co UBC CONSTRUCTION MANAGEMENT LAB  REPCON T “  TEST PROJECT FOR THESIS - EXTENDED  ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative  •  ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative  c)  Report Date: 13APR93 Report Time: 28:11:18 Progress Date: Revision Number: 8  • ^ CLASS/SUBCLASS/RESOURCE •^ ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative  1  RESOURCE USAGE REPORT  File Used: D:\REP200\PROJ10\ASHONE Report Period: 01MAR93 - 1EIJUN93 Selected Resources. All Project Activities.  Resource: LABOURERS Usage: Rate Unit: MEN/DAY Logistics: Used to level: No Weight:^1.88  co  TEST 1  co  • DAILY/CUMULATIVE RESOURCE USAGE  ^•  01MAR93 02MAR93 03MAR93 84MAR93 85MAR93 0003 07MAR93 08MAR93 09MAR93 10MAR93 11MAR93 121111193 13MAR93 1003 15MAR93 16MAR93 17MAR93 18MAR93 19MAR93 28MAR93 21MAR93 14.00^14.88^14.00^38.00^38.08^38.60^36.88^66.60^66.00^66.88^66.00^66.00^81.88^81.00^81.80^76.00^76.08^76.00^76.00^76.80^76.00 14.00^28.88^42.00^80.08^118.80^156.80^192.08^258.08^324.08^398.88^456.08^522.08^603.08^684.80^765.08^841.00^917.00^993.00 1069.00 1145.88 1221.00 14.08^14.80^14.00^24.08^24.00^24.00^38.00^44.08^44.88^54.00^54.00^54.00^51.00^57.80^57.08^69.88^69.08^69.00^51.00^57.00^57.80 14.00^28.08^42.00^66.00^90.88^114.00^152.08^196.00^240.88^294.68^348.08^402.88^453.08^518.80^567.08^636.08^705.00^774.80^825.80^882.00^939.00 14.00^14.00^14.08^38.00^38.80^38.00^36.80^66.80^66.80^66.00^66.08^66.80^69.80^69.00^69.00^78.00^78.00^78.00^76.00^76.80^76.00 14.80^28.80^42.00^WOO^118.08^156.80^192.00^258.08^324.60^390.00^456.80^522.08^591.08^668.00^729.08^887.08^885.00^963.80 1039.88 1115.08 1191.88 221111193 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 30MAR93 311111193 81APR93 82APR93 03093 84APR93 05APR93 86APR93 07093 08APA93 09APR93 10APA93 11APR93 76.80^76.00^76.88^76.88^76.80^76.08^73.00^73.00^73.00^71.00^71.00^66.00^66.80^66.00^66.00^66.00^66.80^66.00^63.80^63.80^63.80 1297.00 1373.00 1449.00 1525.00 1601.80 1677.00 1758.80 1823.00 1896.00 1967.00 2038.00 2104.00 2170.00 2236.00 2302.08 2368.00 2434.00 2500.80 2563.00 2626.08 2689.00 66.88^66.80^66.00^48.08^57.80^57.80^66.80^66.80^66.00^46.00^55.00^55.00^66.00^66.88^66.08^46.80^50.08^50.80^58.00^58.00^58.08 1085.80 1071.00 1137.00 1185.00 1242.88 1299.80 1365.00 1431.08 1497.00 1543.00 1598.08 1653.00 1719.80 1785.08 1851.80 1897.00 1947.00 1997.00 2055.00 2113.00 2171.80 76.00^76.08^76.88^66.00^66.08^66.00^73.80^73.00^73.00^63.00^63.00^68.80^68.08^68.80^68.00^68.08^68.80^58.00^55.08^55.00^55.00 1267.00 1343.88 1419.00 1485.80 1551.00 1617.80 1698.80 1763.00 1836.80 1899.80 1962.88 2830.80 2098.80 2166.88 2234.08 2302.00 2378.08 2428.08 2483.80 2538.88 2593.00 12APR93 13APR93 14093 15APR93 16AP1193 17APR93 18APR93 19APA93 20APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 ZDAPF193 29APR93 38APR93 01MAY93 02MAY93 58.08^58.00^58.00^60.00^60.80^68.00^60.00^60.80^68.00^57.00^57.00^57.00^57.00^57.00^57.00^52.00^52.00^52.00^42.00^42.80^42.00 2747.08 2805.00 2863.00 2923.00 2983.00 3043.00 3183.80 3163.00 3223.06 3280.08 3337.00 3394.88 3451.88 3588.00 3565.00 3617.80 3669.00 3721.80 3763.00 3885.00 3847.00 38.00^45.08^45.00^53.08^53.08^53.00^38.00^45.00^45.00^53.00^53.00^53.00^38.00^45.80^45.08^50.00^58.08^58.00^33.00^43.88^43.80 2209.00 2254.00 2299.80 2352.80 2405.80 2458.80 2496.00 2541.00 2586.88 2639.00 2692.88 2745.00 2783.00 2828.08 2873.00 2923.08 2973.00 3023.88 3056.00 3099.00 3142.08 58.00^43.00^43.00^58.08^50.00^50.00 ^58.00^43.88^43.00^43.88^50.80^58.00^58.00^50.88^43.80^38.80^38.80^42.00^42.00^42.08^42.00 2651.00 2694.80 2737.00 2787.00 2837.80 2887.80 2937.08 2980.08 3023.80 3066.00 3116.00 3166.80 3216.80 3266.00 3309.08 3347.00 3305.08 3427.08 3469.08 3511.00 3553.00 83MAY93 84MAY93 05MAY93 06MAY93 07MAY93 08MAY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 35.88^35.8035.80^35.08^35.00^35.08^35.00^35.80^35.80^30.00^25.88^25.88^25.08^25.80^25.80^25.00^25.00^25.00^25.88^5.00^5.80 3882.80 3917.00 3952.08 3987.00 4022.00 4057.00 4892.00 4127.00 4162.08 4192.00 4217.00 4242.00 4267.80 4292.00 4317.08 4342.80 4367.00 4392.88 4417.00 4422.80 4427.08 50.80^50.08^50.00^33.00^38.00^38.00 ^45.08^45.08^53.80^28.00^33.00^37.00^45.00^45.00^45.00^17.00^45.80^45.00^45.00^37.08^37.88 3192.86 3242.00 3292.00 3325.80 3363.80 3401.00 3446.00 3491.80 3544.08 3572.80 3605.08 3642.80 3687.08 3732.08 3777.80 3794.00 3839.00 3884.80 3929.80 3966.00 4803.88 38.00^38.00^38.80^42.00^42.08^42.00^42.00^38.00^38.80^33.80^37.08^37.88^37.00^37.00^25.00^25.00^25.00^25.00^25.00^20.88^20.00 3591.00 3629.00 3667.00 3709.88 3751.00 3793.80 3835.80 3873.80 3911.00 3944.80 3981.80 4818.00 4055.80 4092.00 4117.80 4142.00 4167.00 4192.00 4217.00 4237.00 4257.88 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 81JUN93 82JUM93 83J1193 04JUN93 05JUN93 86JUM93 87JUM93 88,111N93 09JUN93 10JUN93 5.80^5.00^5.08^5.00^5.88^5.00^5.00^5.00^5.80^5.80^5.00^5.00^5.80^5.00^5.80^5.00^5.08^5.00 4432.08 4437.00 4442.08 4447.80 4452.00 4457.00 4462.88 4467.08 4472.08 4477.00 4482.08 4487.00 4492.00 4497.08 4502.88 4507.80 4512.80 4517.80 17.00^37.08^30.80^40.80^40.08^40.80^20.08^48.08^40.88^40.08^40.00^40.80^15.80^15.88^15.00^15.00^15.00^15.00 4020.80 4057.08 4087.08 4127.00 4167.00 4287.08 4227.00 4267.80 4387.00 4347.88 4387.80 4427.00 4442.80 4457.08 4472.00 4487.00 4502.08 4517.00 20.00^10.00^10.80^18.00^10.00^10.08^20.00^20.80^15.00^15.80^15.00^15.80^15.80^15.80^15.00^15.00^15.80^15.00 4277.00 4287.00 4297.88 4307.08 4317.08 4327.00 4347.00 4367.08 4382.80 4397.00 4412.08 4427.80 4442.00 4457.00 4472.88 4487.00 4502.00 4517.80  it  (XI  Chapter 2. Linear Scheduling^  18  subclass and a class (e.g., a rough terrain 40 ton crane can belong to the subclass "crane" which in turn belong to the class, "equipment"). Variable resource usage profiles can be attached to an activity - different rates from location to location, and a variable rate at a location. See Figure 2.6 for a hypothetical resource usage profile for a continuous activity. Resource can be aggregated (providing they have the same usage units - e.g., men/day) and leveling can be performed for individual or aggregated resource profiles.  A tabular resource usage report (see Table 2.3) was incorporated as well as the ability to export an ASCII file. File output was used to generate the resource usage profiles at the project level shown elsewhere in the thesis.  f el Chapter 3 REVIEW OF RESOURCE LEVELING LITERATURE  3.1 INTRODUCTION In this chapter, I present a brief review of the literature on resource leveling for network based scheduling. Emphasis is placed on methods which are applicable to practical-sized projects. Presentation and extension of the Minimum Moment Algorithm by Harris (22) is found in Chapter 4.  3.2 BURGESS AND KILLEBREW The method by Burgess and Killebrew (9) for resource leveling is introduced first. This method is particularly noteworthy for this thesis because the criterion to measure effectiveness of resource utilization, which is "the sum of the squares of resource requirements" for each period over the project duration, has also been adopted by Harris (22) for the Minimum Moment Algorithm - see Chapter 4. With the minimization of variance of the daily resource demands over the project duration, the peaks and valleys are leveled and the sum of the squares of daily resource demand decreases. The objective of this leveling procedure is to shift the activities in their float periods in such a way that the sum of the squares of the daily resource demands over the project duration is minimized. The method applies to constant resource usage over the activity duration.  To begin with, an early start schedule is prepared for the network and slack or float values  Chapter 3. Review of Resource Leveling Literature ^  20  are computed for each activity. Activities are listed in the order of precedence by arranging the arrow heads or node numbers in ascending order. If two or more activities have the arrow head numbers tied then the activities are listed in such a way that the arrow tail numbers also follow the above rule. This ensures a unique ranking because all activities are required to have a unique i-j designation. The shifting procedure commences with the last activity and with the calculation of the respective total sum of squares of resource requirements for each day of the activity's possible shift. The activity being considered is shifted to the time location which gives the least sum of squares. If the sums so obtained are the same for two or more locations then the activity is positioned in the location which gives the maximum shift. The early start date and early finish date of the shifted activity are updated as well as the float values of those activities which are affected due to the shift. The procedure is repeated until the first activity is reached. During this cycle if there has been any improvement then the above procedure is repeated once again. In this way the above cycle is iterated until no further improvement in the total sum of squares of resource requirements is achieved. The schedule thus obtained represents a leveled resource profile.  The disadvantage of this approach is that a resource buildup occurs at the end of the project. The procedure does not position activities in a way so as to obtain an optimum solution, although this may happen by chance. To get the optimum solution, alternate schedules have to be obtained using a different order of activities for shifting. The number of these alternate schedules will be large even for small projects rendering the approach an impractical one. Alternatives to the sequence of the leveling steps have been suggested by  Chapter 3. Review of Resource Leveling Literature ^  21  the authors in order to approach optimum results. One suggestion is to start the procedure with the first activity instead of the last one and proceeding to the last activity, utilizing the available free floats. In the second and the subsequent cycles, activities may be moved both to the right or left in order to attain the best solution. Another suggestion is to use total float as the range of the activity shift.  The example discussed by the authors is for activities in a cyclical sequence. It has therefore not been included.  3.3 BURMAN Burman (10), in his book presents a method for resource leveling which also minimizes the total sum of squares of resource requirements. While the Burgess-Killebrew approach uses free float as the limit of the activity shift, Burman's approach uses total float as the maximum activity shift criterion. It should be noted that Burgess and Killebrew suggested in their paper that this change could be tried out. The leveling operation is performed after making the resource allocation based on the resource availability. Therefore, the initial resource profile at the start of the leveling operation may not necessarily be the early start profile.  The example network shown in Figure 3.1 has been discussed in his book. The network schedule and the resource details are shown in the figure itself. The initial and leveled resource profile are given in Table 3.1 and in Figure 3.2. It should be noted in this example  22  Chapter 3. Review of Resource Leveling Literature ^  that the initial resource profile is not the early start resource profile but is the one obtained after making resource allocation. duration early start time  1  early finish time  21517  Critical path^activity number  E 6 31018  f^f  21416  01212  El 5  A2  71  51317  late start time  61^1 1 7 C9 111 4 112  o 111  late finish time  resources Sample activity  0 1 01 0  01212  Start 1  D3  01010  01612  21517  E  31018  \ 1101,■  ii..  7 1 4 111 F 10  a  1  8 1 2 112  0.-  111 3114 0 12 1210 15  151 0 115 Finish 13 151 01 15  218110H  H7 2 1 4 110  0  1 1^1  1  14 614 1 7  1 13i4 J^8 7 1 5 110  1110,..., 101 5 115 K 11 101 2115  Figure 3.1 3.1 Network and Schedule for Burman's example, Burman (10).  3.4 LEVY, THOMPSON AND WEIST  Levy, Thompson and Weist (45) proposed a resource smoothing program which was originally programmed for leveling manpower in naval shipyards. However, the method has general applicability including the construction industry. The method is a multi-project  9 R8 • 7 0  u 6 5 4 ▪ 3  t 1 0 1^2  3  4  5  6  7^8  .  10  11  12  "Meet cloy: after leveling  ^ before leveling  13  14^15  critical resources  Figure 3.2 Resource histograms before and after leveling; Burman (10)  t•J  24  Chapter 3. Review of Resource Leveling Literature ^  Table 3.1 Resource levels before and after leveling (Burman) Project Day  1  2  3  4  5  6  7  8  Daily Resource Aggregates  9  9  8  4  4  9  9  9  6  9  7  8  4  9  9  9  Project Day  9  10  11  12  13  14  15  Daily Resource Aggregates  6  6  6  4  2  2  2  6  6  4  6  2  2  2  Before Leveling Daily Resource Aggregates After Leveling  Before Leveling Daily Resource Aggregates After Leveling  leveling procedure. For each project, activities are deemed to start at their early start dates and their float values are established. A resource profile is then generated for each project. The next step is to set the "trigger levels" one resource unit below the peak requirements in each project and then reschedule the jobs so that peak requirements in all projects drop below the trigger level. After shifting, if the trigger levels are not exceeded for all projects, and time intervals, then the trigger level is dropped further and the process is repeated until the shift of some activity causes the resource level to exceed the trigger level. The activities on this peak day are examined, and ones without floats are dropped from consideration for  Chapter 3. Review of Resource Leveling Literature^  25  shifting. From the remaining, one is picked at random and rescheduled to a point beyond the peak day. The schedule is then updated for the following activities.  If, during the process, it becomes impossible to reduce the peak below the trigger levels in one or more projects, then the former set of trigger levels is recalled and the trigger levels are examined independently for each project starting with the project utilising the most expensive resource. The trigger levels for this project are reduced one unit at a time until further reduction is impossible. Then the next most expensive resource is examined and the procedure repeated. This is done for all projects until no further reduction of the trigger level is possible, thus leading to a final schedule.  The above procedure is repeated a number of times, using a random choice step in the algorithm. This way a set of schedules with different leveled profiles will be obtained from which the best solution can be chosen. Thus, optimal results cannot always be produced and the effectiveness of the method is problem dependent, varying with the amount of activity floats and the number of non-critical activities in the network. They do not discuss any example in their book.  3.5 HARRIS The Packing Method for resource leveling by Harris (23) approaches the problem by first considering a base histogram comprised of critical activities and then arranging the noncritical activities over the base histogram in such a way so as to get a project minimum  Chapter 3. Review of Resource Leveling Literature^  26  resource histogram, defined as the resource histogram with minimum moment. However, this minimum moment of the histogram is not the absolute minimum because the procedure does not necessarily place the activities so as to get an optimized resource profile. The procedure is based on a few heuristic rules which are used to make a priority list of activities which are candidates for assignment. This priority list is called a "processing queue" and the activities are selected for assignment, one by one, based on their order in the processing queue. The heuristic rules adopted for constructing a processing queue are, 1)  select first the activity with the greatest resource rate 'r',  2)  if tied, select the activity with the smallest total float,  3)  if still tied, select the activity with the greatest sequence step number,  4)  if still tied, select an activity at random.  The packing algorithm assumes constant resource usage across the activity duration. The decrease in the moment of the histogram is directly proportional to the resource rate 'r' of the activity. Assuming other factors remain the same, when two or more activities with different resource rates compete for a particular position, then the activity with the greatest resource rate gives the greatest reduction in the histogram moment. The total float of an activity also represents the total float of the activity chain to which it belongs. Thus, if the initial activity in a chain is assigned first, then it would decrease the total float of the chain by the amount of float it consumes. This would decrease the possible assignment positions of the later activities in the chain. To prevent this from happening, the activity at a later sequence step is selected first for assignment, if the resource rate and the total float of the activities under consideration are tied. Thus, when the later activity in the chain is positioned  Chapter 3. Review of Resource Leveling Literature ^  27  first then the activities preceding it would retain certain amounts of float which will depend upon the float consumed by the activity being positioned.  Thus, the assignment procedure starts with the activity with the greatest resource rate 'r'. For the candidate activity, all of its possible assignments are identified, including the maximum shift to the activity's late finish date. For each assignment, the histogram ordinates to which the activity's resource rate are added are summed up. The number of elements of the histogram to be summed is equal to the number of unassigned days in the duration of the activity (equal to the number of days after the early finish date to be occupied by the activity). The sum of the histogram ordinates for each of the preceding activity's future assignment are calculated. The minimum of these sums is the penalty contributed by the preceding activity for making the particular assignment of the activity under consideration. In a similar way the penalty contributed by preceding activities is calculated for each possible assignment of the activity under consideration. Similarly, the penalty contributed by the succeeding activities is calculated for each possible assignment of the activity under consideration.  For each possible assignment of an activity the sum of the histogram ordinates and penalties contributed by all preceding and succeeding activities are summed up. The minimum of these sums points to the assignment to be made for the activity. If two or more of these sums are equal then the activity is assigned so that it retains the maximum amount of float. With the activity's assignment accomplished the histogram ordinates are updated. The above  28  Chapter 3. Review of Resource Leveling Literature^  procedure is repeated for all activities in the processing queue. 18  early start date  5  i  1_  12  0  2  O1  010  4  r  4^  4  5 1  ...— activItY number  t^t  duration  17  ^  number of resources  Sample activity  6 3122 7  111  10  f1  4  1 6  8  1  2  3  —  1 9  1  2  010 ^ Start 1  7  early finish date  i 2^1  41  -O.  15 116  ^► Finish 12  —1110.- 1 r 2  4110  7  8 1 O11  10 115  4  ^b.  I  1  1  8  818  Critical path  Figure 3.3 Network and Schedule for Harris's Packing Method, Harris (23)  The order of activities in the processing queue will affect the end results and also the efficiency of the leveling operation. As mentioned previously, the total float for any activity is equal to the total float of the chain of activities to which it belongs. Thus if a preceding activity in the chain gets shifted then it affects the total floats of succeeding activities. Therefore, if in the priority list, the first few activities are those which occupy earlier positions in the various chains or network and if they are assigned first, this assignment will reduce the total float of activities in the respective chains. This reduced total float of succeeding activities also reduces shifting opportunities, affecting the potential for  29  Chapter 3. Review of Resource Leveling Literature^  improvement of the histogram moment. From the above it can be concluded that reasonable results can be expected only when, in the processing queue, the activities from the later part of chains are placed at a lower position when compared to the earlier activities in the chains. Therefore, the efficiency of this method for resource leveling is largely problem dependent.  The example network shown in the Figure 3.3 was presented by Harris (23). The network schedule and the resource details are shown in the figure itself. The initial and resource leveled profiles are given in Table 3.2 and in Figure 3.4.  Table 3.2 Resource levels before and after leveling (Packing Method) Project Day  1  2  3  4  5  6  7  8  Daily Resource Aggregates  7  9  11  11  16  16  12  6  7  9  7  7  10  10  10  6  Project Day  9  10  11  12  13  14  15  16  Daily Resource Aggregates  6  6  3  1  1  1  1  2  6  6  5  7  7  7  3  2  Before Leveling Daily Resource Aggregates After Leveling  Before Leveling Daily Resource Aggregates After Leveling  1^2^3^4^5^6^7^8^9^10 ... da y; after leveling^^ before leveling  ^  ^  11^12^13^14^15^16  critical resources  Figure 3.4 Resource histograms before and after leveling; Harris (23)  ^  31  Chapter 3. Review of Resource Leveling Literature ^  3.6 EASA  Easa (18) formulated an integer linear optimization model for resource leveling which guarantees the optimal leveling for the assumptions made. They include the requirement that activities not be split. The procedure is for a single resource, but multiple resources can be leveled in a single operation if they can be expressed in a common unit (e.g., men/day).  early start time^early finish time  Critical path  activity number  314 ^ir.  E6  112  ^t  ^t duration^resources Sample activity 012 A 2 2110  215 B 5  316 2 13 D4  114 010 Start 1 010  .410.  ,____5_ j_._.  Finish 7  oI0  01 1  314  1i2  112  3^  Figure 3.5 Network and schedule for Easa's example, Easa (18)  Chapter 3. Review of Resource Leveling Literature ^  32  The objective function used in this method is to minimize the absolute deviations between the resource requirements and the desired resource usage rates at the overall project level. These rates may be represented either by uniform or non-uniform resource usage levels. For the objective of uniform leveling, the condition of absolute deviation minimization from a uniform resource level may render the project resource histogram being close to level but with frequent variations from uniformity. To minimize these variations, another measure suggested is to minimize the absolute deviations between the project resource rates of consecutive time units.  CPM scheduling results and the activity resource usage rates are required as input. The resource usage rates are assumed to be constant over the activity duration. Using this data, an interface program automatically creates a file consisting of the objective function and the constraints of the model. The resulting file constitutes the input to an integer linear optimization program, UNDO, which solves the model. The main feature to be noted about the model is that optimal leveling is guaranteed.  The model is good only for small or medium-sized projects. The number of variables and constraints is a function of project duration, number of non-critical activities and their float times. For large projects the number of variables and constraints will exceed the capacity of the UNDO routine.  The example network shown in Figure 3.5 was discussed in their paper. The network  Chapter 3. Review of Resource Leveling Literature  ^  33  14 R.  12 10  on. 8 6 cr s 4  p^2 1  ^ ^ ^ ^ 4 5 3 2  Project:day 111 after leveling^^ before leveling  ^  critical resources  Figure 3.6 Resource histograms before and after leveling (Uniform histogram criteria); Easa (18)  14 12 10 u n 8  e c  -  t 6 s. c^4 2 0 1  ^ ^ ^ ^ 5 4 2 3  'Projectday  :  after leveling  ^  ^ before leveling  ^  critical resources  Figure 3.7 Resource histograms before and after leveling (Min. daily resource variation criteria); Easa (18)  Chapter 3. Review of Resource Leveling Literature ^  34  schedule and the resource details are shown in the figure itself. The initial and leveled resource profiles are given in Table 3.3 and in Figure 3.6 and Figure 3.7  Table 3.3 Resource levels before and after leveling (Easa) Project Day  1  2  3  4  5  Daily Resource Aggregates  14  10  8  8  6  10  10  8  10  8  10  10  10  8  8  Before Leveling Daily Resource Aggregates After Leveling (Uniform Histogram Criteria) Daily Resource Aggregates After Leveling (Minimum Daily Resource Variation Criteria)  3.7 ANTILL AND WOODHEAD The leveling procedure proposed by Antill and Woodhead (3) relies on heuristic rules. The early start schedule is used as the starting point. All critical activities are started at their earliest so that the project finish is not delayed. Total float for an activity represents its range of shift. The total float of the activity is also equal to the total float of the chain of activities to which it belongs. The chain of activities with the smaller total float gets priority for shifting. With this priority criterion the activities are then shifted in their float periods  35  Chapter 3. Review of Resource Leveling Literature ^  based on some other heuristic rules. duration early start time^early finish time  Critical path^activity number  01818 2  101^1 1 0  8 19117  5 151 01 1  resource 1 (manpower)  171 8 125  9  resource 3 (equip. B)  resource 2 (equip. A)  8^0 1 0  Sample activity  0^0 0 ^ Start 1  01414  0 10 lo ^  5 1010 ^  3  25 0 25 ► Finish 11 01010  4 114[ 18 6 4 1 1^  ►  1 ^o  4 7 31010  01515 4  5  8 1010  e^o^1  I 7 112 8  121 3 115 10 71 0  o  Figure 3.8 Network and Schedule for Antill & Woodhead's example, Antill and Woodhead (3)  For the chains of activities involving many activities and utilizing various labor requirements, skills and equipment, the resources can be leveled in a series fashion. The best way suggested is to start with the labor craft or major equipment item having the greatest variations in the levels. Disregarding other resources, this resource is leveled first and then the process moves to the next resource and so on until a satisfactory overall resource profile  Table 3.4 Resource levels before and after leveling (Anti11 & Woodhead)  Project Day  1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  Daily Resource Aggregates Before Leveling (Manpower)  23  23  23  2.3  25  23  23  23  28  28  25  25  26  26  26  19  19  12  8  8  8  8  8  8  8  Daily Resource Aggregates After Leveling (Manpower)  18  18  18  18  18  21  21  15  20  19  19  19  19  19  19  19  22  21  21  21  21  21  19  15  15  Daily Resource Aggregates Before Leveling (Equipment A)  1  1  1  1  2  2  2  2  1  1  1  1  1  1  1  1  1  1  0  0  0  0  0  0  0  Daily Resource Aggregates After Leveling (Equipment A)  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  0  0  Daily Resource Aggregates Before Leveling (Equipment B)  0  0  0  0  0  1  1  1  2  2  2  2  1  1  1  1  1  0  0  0  0  0  0  0  0  Daily Resource Aggregates After Leveling (Equipment B)  0  0  0  0  0  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  0  0  0  -  .  Chapter 3. Review of Resource Leveling Literature ^  30  R 25  u^  s n 20  °  ....  i 115  r^10 5  0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25  HPibjett.-diYi: after leveling  ^  ^ before leveling^/ critical resources  Figure 3.9 Resource levels before and after leveling - Manpower; Antill - Woodhead (3)  2R  e s_ n i^1  e 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Project day: after leveling  ^  ^ before leveling^critical resources  Figure 3.10 Resource units before and after leveling - Equipment A; Antill - Woodhead  37  Chapter 3. Review of Resource Leveling Literature^  38  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25  roject day after leveling^El before leveling  / critical resources  Figure 3.11 Resource units before and after leveling - Equipment B; Antill - Woodhead (3)  is obtained. Networks involving complex chains, the same craft or equipment may have to be reviewed many times to obtain an acceptable schedule by virtue of the shifting and reshifting of the activities involved. The best approach recommended is to first shift activities with small total float followed by the activities with large float. Thus for this method, the leveling effectiveness depends upon the amount of activity floats, number of critical activities in the network and the assigned resource priorities.  The leveling operation was carried out for the network shown in the Figure 3.8. The project  Chapter 3. Review of Resource Leveling Literature ^  39  involved three kinds of resources - Manpower, equipment A and equipment B. First priority was given to leveling the resource requirements of the equipment. The network schedule and the resource details are shown in the figure itself. The initial and leveled resource profiles are given in Table 3.4. and in Figure 3.9, 3.10 and 3.11. These profiles are for a single schedule. Note that the leveled profiles for equipment A and equipment B, in addition to the required resource usage also include 1 day of overhaul period.  3.8 DAVIS  Other work on the resource leveling problem has been reviewed by Davis (16). Citing the work of Dewitte (17), he comments that the model minimizes manpower fluctuations by shifting the project activities in their slack periods. Here, the measure of effectiveness is the minimization of absolute magnitude of fluctuations from a calculated project mean level of resource usage. The resource profile is partitioned into specially derived intervals and then each interval is leveled in sequence updating the early start times and slacks of the affected activities. He further comments that although the method is simple in concept, it is lengthy and intricate when compared to the Burgess-Killebrew algorithm. Referring to the work of Wilson (46), he comments that it is a modification of Levy's method. The modification Wilson suggests is that, instead of a random choice step, a dynamic programming scheme be introduced at each iteration to determine feasible combinations of activities for rescheduling. It is suggested that the method is simple to use for small problems. However, it would quickly lead to computational complexities for large projects.  Chapter 3. Review of Resource Leveling Literature^  40  3.9 SUMMARY From the above review it can be observed that most of the leveling procedures are based on arbitrary rules which do not necessarily lead to an optimized solution. For most procedures, the final solution is largely problem dependent. Optimizing techniques when used on large projects quickly lead to computational complexities because the large number of variables and constraints involved exceed the handling capacity of existing optimization routines. Heuristic leveling procedures seem to be the only choice for actual projects. Although heuristic procedures do not guarantee an optimized solution, they are computationally efficient and can produce satisfactory resource leveled schedules.  Chapter 4  41  THE MODIFIED MINIMUM MOMENT ALGORITHM  4.1 INTRODUCTION Harris's (22) Minimum Moment Algorithm has been adopted as the starting point for the development of a resource leveling algorithm for linear scheduling. It has been selected for the following reasons. First, being an unlimited resource leveling procedure, it does not extend the project length. Second, the procedure is not based on random decisions rules and therefore its application guarantees an improvement in the resource profile, eliminating any chance of worsening the resource profile. Third, it is possible to treat multiple resource cases. Fourth, the potential exists to extend the algorithm to treat a variable resource usage profile for any activity. Fifth, the procedure can be extended for linear scheduling. Sixth, activities may be leveled so as to enclose the leveled profile within a preferred resource histogram.  In this chapter, I first present a brief introduction to the original algorithm. It is then extended to cope with nonuniform resource usage profiles at the activity level and is further extended to the linear scheduling case as implemented in the REPCON system.  4.2 THE MINIMUM MOMENT ALGORITHM: An Introduction The Minimum Moment Algorithm is an unlimited resource leveling procedure introduced by Harris (22). The project length is not altered by the use of this algorithm. When the resources consumed by the activities in a project are in the form of a histogram over the project duration,  Chapter 4. The Modified Minimum Moment Algorithm ^  42  then the Minimum Moment Algorithm for resource leveling seeks to minimize the moment of this histogram.  Assumptions that accompany this algorithm are as follows. First, an early start schedule constitutes the starting point. The maximum amount by which an activity can be shifted is equal to the free float of the activity. Activities are continuous throughout their duration i.e., activity splitting is not considered. The resource usage rate should be constant over the entire duration of an activity. In this thesis, this assumption has been removed. The final assumption is that the logic or precedence relationships among activities remain unaltered during the whole leveling process - an assumption common to virtually all leveling procedures.  The concept of Minimum Moment Algorithm is based on the theorem that, for a given set of elements in histogram form arranged over a fixed intervals, the minimum moment of the elements exists when the histogram is a rectangle over the interval set.  In the original method, the critical path method is used for network analysis. The shifting process is divided into two parts, a forward pass followed by a backward pass. Starting with the early start schedule, the activities are first shifted to a later time slot in the forward pass and the backward pass then shifts the activities to an earlier time slot when there is an improvement in the resource histogram. Activities are shifted backwards during the backpass operation to help avoid a resource buildup in the later portion of the project.  Chapter 4. The Modified Minimum Moment Algorithm^  43  On any day in the network, for all activities scheduled on that particular day, the respective resources are summed up to get an aggregate resource usage. This sum is called the "daily resource aggregate". Repeating this for all days of the network, an aggregate resource profile is obtained for the entire network duration. The sum of the squares of the resource aggregate for each day in the project schedule is used as a measure of the effectiveness of the leveling procedure. This sum of the 'daily resource aggregates' decreases as the peaks and valleys are smoothened over the project duration. The concept of "improvement factor" has been introduced by Harris to decide which activity to shift in order to minimize the histogram area. The term 'improvement' refers to the decrease in histogram moment resulting from the shift of an activity.  Two factors control the order in which the activities are to be shifted. They are, i)  Sequence Step Number, and  ii)  Resource Improvement Factor.  An activity's sequence step number is the earliest logical position that it can occupy while preserving its logical relationships with other activities. The shifting procedure starts with the activities on the last sequence step, with the resource improvement factor being the basis for selecting the activity to shift. An improvement factor is computed for all activities on the sequence step for each possible shift day. The activity with the largest non-negative improvement factor is shifted by the respective amount of shift. Once all activities on the current sequence step have been examined and no further improvements in the histogram  Chapter 4. The Modified Minimum Moment Algorithm ^  44  moment are possible, the activities on the next earlier sequence step are examined. The process continues until the first sequence step is reached and all activities have been examined. At this point, the shifting process is reversed, starting from the first sequence step and progressing to the last. The final histogram moment so obtained due to these daily resource aggregates is the minimum and is representative of the leveled resource demands.  If done manually, this approach is unworkable for large networks and several resources. Once programmed, however, it poses few restraints. Interestingly, no computational experience with the original algorithm has been published. When dealing with more than one resource, they may be leveled one by one in series or may be aggregated before a single application of the leveling procedure. The final solution is generally different depending on the order in which resources are leveled and leveling using an aggregated profile provides yet another final histogram for each resource. The latter approach assumes identical resource usage units or the transformation of all resources into monetary units. If any particular resource is to be given priority then a preassigned weighting of the resource may be used to favour its shifting. See Harris (22) for a description of a rather elaborate weighting scheme.  4.3 THE CONCEPT OF IMPROVEMENT FACTOR  The improvement factor quantifies the reduction of the histogram moment when an activity is shifted. It is used to determine the activity to be chosen for shifting from a given set of activities on a sequence step so as to reduce the histogram moment by the maximum amount. The basic  Chapter 4. The Modified Minimum Moment Algorithm ^  45  Minimum Moment Algorithm assumes that all activities in the network have a constant resource usage over their activity duration - thus Harris's improvement factor is specific to this case. For actual project situations, not all activities have a constant resource usage rate (e.g. cranage may only be required for the start-up of an activity). One of the major objectives of this thesis is to extend the minimum moment algorithm and the concept of improvement factor to the general resource usage profile case at the activity level. Presented below is the mathematical formulation for both cases. First, the improvement factor expression for those activities which have a constant resource usage over their duration is derived, followed by the improvement factor expression for those activities which have variable resource usage over their duration.  43.1 Improvement Factor for Activities with Constant Resource Usage Profile  Consider an activity, a, with duration, T. Let the shift of the activity be S, and the resource usage rate of the activity be represented by r. S can have a maximum value up to the free float of the activity. The resource usage aggregate on any project day j, j = 1, 2,^, finish date, is represented by, xi. Let m be a factor, defined as the minimum of either the days that the activity is to be shifted, S, or the activity duration, T. Thus, m = min(S, 7). See Figure 4.1 for an illustration of the foregoing variables. The reader should note the following convention. The time counter starts at time 0. Thus, the early start time, EST, for the first activity is set equal to zero. For a duration T, this means that the activity's start and finish times are 0 and T, respectively, or the activity spans day 1 through to day T. In what follows an activity is positioned by its early start time, and the day counter j starts at EST + I.  Chapter 4. Modified Minimum Moment Algorithm ^  46  constant resource rate 'r' for activity "a"  resource profile  duration r- T 8 ESTa= 3  EFTA 11  shift  8=3  daily resource aggregates 'x ^ project day 'j'  1  2  3  4  5  6  7  8  9  10 11  12 13 14 15 16 17 18 19  Time ---.-0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 project resource histogram with cross-hatched area representing the portions of the histogram affected due to the shift of activity "a" Figure 4.1 Shifting activity with constant resource rate  Chapter 4. The Modified Minimum Moment Algorithm ^  Let  X (EFT  a +1)  47  , x (En...,„, ) be the set of daily resource aggregates,  • x (EFT„+2) •  from which m daily resource rates,  r, are  to be deducted. In Figure 4.1, this is represented by  the cross-hatched area on the left side marked as T. j — ESTa +M  [X1 ]  -^E  xi  [4.1]  J-ES; + 1  The corresponding set of daily resource aggregates after the shift,  S,  will be,  j —ESTa +M [XXI]  Let  x ( EFTa+S-m+1) • X (EPTa+S-m+2)  —^  E^(xj -r)  [4.2]  j—ESTa +1  • ^ • X ( Erra+s)  aggregates, to which m daily resource rates,  r, are  represent the set of daily resource  to be added. In Figure 4.1, this is represented  by the cross-hatched area on the right side marked as 'II'. j — EFTa + S  [X2  ]  ^ xi E^ j—EFT + 1  —^  a  [4.3]  S— M+  The corresponding set of daily resource aggregates after the shift,  S,  will be,  j — EFTa + S [XX2]  —^  E^(xi +r)  j — EFTa + S—M+1  [4.4]  Chapter 4. The Modified Minimum Moment Algorithm ^  48  By looking at the resource histogram in Figure 4.1, it can be seen that the shift of activity a will only affect the cross-hatched portions of the resource histogram. The remaining area will not contribute to any change in the histogram moment, and can therefore be neglected.  Thus, the moment of the resource histogram to be considered before shifting the activity is the sum of the squares of /X,] and X21 (areas I and II in Figure 4.1). Thus, j—ESTa+M^j—EFT,+S  E^X  2 •  [4.5]  j—ESTa +1^j—EFTa+S—M+1  Similarly, the moment of the histogram after shifting the activity is the sum of the squares of p0C/J and 1rx21. Thus, j—ESTa +M^j—EFT,+S  E^  r)  (x— 2 +^ M2^ j • ESTa +1^j—EFTa+S—M+1  (xi +r)  2  [4.6]  Improvement in the histogram moment will result from the shift, 5, only when M2 5- Mr Therefore, j—ESTa +1^j—EFT,+S  E^(xj — r)  2 +^  j—ESTa +M^j—EFTa+S—M+1  (xj+r) 2  Chapter 4. The Modified Minimum Moment Algorithm ^  j —ESTa +M  49  j — EFTa + S  4 j —EST,+1  +  XJ E j — EFTa + S-111+1  2 •  [4.7]  From the above expression we get, j • - ESTa +M  E 4  J-ESTa + 1  j —EFTa +S — 2r^ EFTa + S—M+1  E^xi  .1-  j+ESTa +m j —EFTa + S—M+1  2 X • J  + mr2 +  j — EFTa + S + 2r^ x•J EFTa +S—m+1  E^  j — ESTa +M  E 4 J-ESTa +1  +  m r2  j —EFTa +S +  5  2  XJ E j —EFTa + S—M+1  •  [4.8]  Rearranging terms, we get, j —ESTa +M^j — EFTa +S —2 r x.J + 2mr 2^5^0 x.J 2r i - EST a +1^j — EFT a + S—M+1  E  +  E  [4.9]  Chapter 4. The Modified Minimum Moment Algorithm ^  50  Factoring out r and dividing through by -2, we obtain, jESTa +M^j EFT,,+S  ,^E  x  r(  ;  -^E^xj — mr )  0  j — ESTa +1^j — EFT a + S-112+1  [4.10]  In the above expression, the left side portion is called the improvement factor. Therefore, for activity, a, with shift, S, the improvement factor, IF, is,  j — ESTa +M^j —EFTa +S  IF (a, S) — r  ,^E x , -^E^xi j—EST +1^j —EFT + S—M+1 .  (  a  -  mr )  a  [4.11]  Thus if an improvement in the resource histogram is to be obtained, then the improvement factor must have a positive value. Equation [4.11] represents the condition originally derived by Harris (22) for determining how much an activity should be shifted.  4.3.2 Improvement Factor for Activities with Variable Resource Usage Profile  Consider an activity a with duration T. Let the shift of the activity be S, and the resource rates for the activity be represented by,  rk,  where the subscript k refers to the activity day, whose  value ranges from 1 to T, respectively. The resource aggregates on any project day j, j = 1, 2,^, project duration,  is represented by, xj. The variable, S, can have a maximum value up to  the free float of the activity. Define factor m as the minimum of either the days that the activity  Chapter 4. The Modified Minimum Moment Algorithm ^  51  is to be shifted, S, or the activity duration, T, i.e., m = min(S,T). With respect to the amount of shift there are two conditions to be considered here for the calculation of improvement factors : 1) When the shift, S, is less than the activity duration, T, and 2) When the shift, S, is  equal to or greater than the activity duration, T. Improvement factor relationships for the two conditions have been derived below. Refer to Figure 4.2 and Figure 4.3 to aid in understanding the derivation that follows. Note that a test of the derivation is that the expression for IF should be the same as previously derived when rk = r for all k.  Condition 1:^The shift S, of the activity is less than the duration, T, of the activity. For this case, the value of m will always be equal to the shift, S, of the activity -i.e., m = S.  Let  X (ESTa +1) 1 X (ESTa +2) ' ^ f X (ESTeS)  be the set of daily resource aggregates,  from which k = S resource rates, ri, r2 ...., rs, are to be deducted, respectively. In Figure 4.2 this is represented by the cross-hatched area on the left side which is marked as 'I'.  [  X1 ]  -^  j—ESTa+S ^x.J j—ESTa +1  E  [4.12]  The corresponding set of daily resource aggregates after the shift will be, j—ESTa +S, k—S  [  XXI.  E^(xi - r j—EST +1, k-1  ^ ]  —  a  k)  ^  [4.13]  Chapter 4. Modified Minimum Moment Algorithm^  52  variable resource rate, co for activity Pa's  resource rates 'rk '  2  ^r^r Cr r3 4 5 6 3 resource profile  duration r T r 8 EFra = 1 1  ESTa= 3 shift S =3  daily resource aggregates 'x  x  project day 'j'  1  1  x  2  2  time^►0 1 2  x 3  3  x 4  4  x 5  5  x 6  6  x  7  7  x 8  8  9  X  10  9 10  x  x  11  12 13 14 15 16 17 18 19  11  12  x x^x^x x x 13 14 15 16 17 18  19  3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 project resource histogram with cross-hatched area representing portions of the histogram affected due to the shift of activity 'a'  Figure 4.2 Shifting activity with variable resource usage profile (S < T)  Chapter 4. The Modified Minimum Moment Algorithm ^  Also,  , X ( Era+s)  X (EFT.+1) , X (EFTa +2) '  to which k = S daily resource rates,  53  is the set of daily resource aggregates,  TT-s+1 , TT-s+2 „  ri. are to be added, respectively. In  Figure 4.2, this is represented by the cross-hatched area on the right side which is marked as  [  x  2  j -EFT,+S  ]  —^E^xi  [4.14]  _1—EFT, +1  The corresponding set of daily resource aggregates after the shift S will be j -.EFTa + S , k-T  E^( xi + r k )^[4.15]  j -EFT,+1 , k-T-S+1  Also, x(EFTa -,s+3.) , x(EFra +s+2) ,  "CEP;  is the set of daily resource aggregates,  from which k = T - S resource rates, rsig , r5+2 , ^ ri. are to be subtracted, respectively, and k = T - S resource rates r1 , r2 ,...., rr_s are to be added, respectively. In Figure 4.2, this is  represented by the cross-hatched area in the middle which is marked as 'BT. j -EFT,  [  x3 1  — E^xi J—EST +S+1 a  [4.16]  Chapter 4. The Modified Minimum Moment Algorithm ^  54  The corresponding set of daily resource aggregates after the shift will be, j—EFTS, k—T—S  [ XX3 ]  -^E^(x; - rk+s+ rk)  [4.17]  j—ESTa +S+1, k-1  By looking at the resource histogram in Figure 4.2, it can be seen that only the sections labelled I, II, and III will be affected by the shift S. The moment of the remaining part of the histogram  is not affected and therefore can be neglected.  Thus, the moment of the resource histogram before shifting the activity will be the sum of the squares of /Xj, /X2/ and /X3/, neglecting non-cross-hatched regions of Figure 4.2. Thus, j—ESTa +S^j—EFTa+S  E  E  2 + • X _7^ Mi —^ j—ESTa +1^j—EFTa+1  2 Ali  j—EFTa 2 Xi  +  [4.18]  j—ESTa +S+1  Similarly, the moment of the histogram after the activity shift will be the sum of the squares of /XXII /XX2/ and JXX3J. Thus, j—ESTa +S, k S  j—EFTa +S, k—T  —  M2 ..  E^(xi - r k ) 2  j—ESTa +1, k-1  4.  E^(x; + r k ) 2 +  j—EFTa +1, k T S+1 —  —  Chapter 4. The Modified Minimum Moment Algorithm ^  k-T-S ..1ESTa +S+1, k-1  ^r k+ s + Id 2  The improvement in histogram moment will result only when  ^  55  [4.19]  Therefore,  M2 5 M1.  j-ESTa +S, k-S^ j-EFTa+S, k T -  (X + (x,--rk) 2 +^ j-ESTa +1, k-1^j-EFTa+1, k T S+1 -  k) 2  -  j-EFTa , k-T-S j-ESTa +S+1, k-1  Ic+s+  k) 2  j- ESTa +S^j-EFTa+S ,  +^  E^x i2  [4.20]  j•.ESTa +1^j-EFTa+1  From the above expression we get, j-ESTa +S  E  k-S  +^rk2  J-ESTa +1  j-ESTa +S, k-S^j-EFTa+S  2^xirk^E^x;2 J-EsTa +i, k-1^j-EFTa+1  k-T^j-EFTa+S, k T^j-EFTa -  + 2^r^xirk^ k T S+1^j-•EFTa+1, k T S+1^j-ESTa+S+1 -  -  -  -  2  Chapter 4. The Modified Minimum Moment Algorithm ^  56  j-EFT,, k-T-S k-T-S^ + Xi ( rk - rk+S ) 2+ 2^E^xk1 (rrk+s) j-ESTa +S+1, k-1  j-ESTa+S i  EESTa +1  2  Xj  j-EFTa+S  +  E Xi  _I-EFTa +1  j -EFT,  +  j -  E  ESTa +S+1  2  [4.21]  X.7•  Rearranging the terms and simplifying,  k-S^j-ESTa+S, k-S^k-T^j-EFTa+S, k-T 2 E^2-1+ 2^ x^ i rk + xirk L k^ - 2 E E X1 ,. j-ESTa +1, k-1 k-T-S+1^ j-EFTa +1, k-T-S+1 '  k-T-S +^(rx- rk+s) iC -• 1  2  j-EFTa , k-T-S + 2^E^xi j-ESTa +S+1, k-1  (rk-  rk+s)  s^0 [4.22]  ^  Chapter 4. The Modified Minimum Moment Algorithm ^  57  Dividing by -1, ^1C-.S^j-ESTa+S, k-S^k-T^j-EFTa+S, k-T 2 -rk + 2 xj r k rk 2^ xark ^-1^j-ESTa+1, k-1^k T S+1^j-EFTa+1, k T S+1  E  -  -  k•.T-S^  -  -  -  j-EFTa, k-T-S  rk+S ) 2 - 2xj ( rk rk+s)^2^0 1^ j-ESTa+S+1,k-1 -  -  -  -  [4.23]  We call the left side of the above expression the improvement factor.  Therefore, for any activity, a, with a shift S, and the shift being smaller than the duration, T, of the activity, the improvement factor, IF, will be, k S^j-ESTa+S, k S rk 2 IF(a, S) -Kirk ^1 ^j-ESTa+1, k-1 -  -  j-EFTa+S, k T  k-T k-T-S+1  -  21c  - 2^  j-EFTa +1, k T S+1 -  Xjrk  -  j EFTa, k-T-S k-T-S^ xj (rk rk+s) 2 - 2^ j-ESTa +S+1, k-1 -  rk+s)  [4.24]  Because of division by -1 in the derivation, the improvement factor must always have a positive  58  Chapter 4. The Modified Minimum Moment Algorithm ^  value in order to reduce the moment of the histogram. Also, if the improvement factor of an activity with constant resource rate is calculated using this procedure, it will be twice the value obtained using the expression for IF derived for the constant resource profile at the activity level. Letting rk = r, for k = 1, 2, T, the improvement factor as obtained from equation [4.24] reduces to: j • • ESTa + S^j -EFTa +S IF (a, S) - 2r  (^  E^x  ;  -^E  xj  -  Sr ) [4.25]  j • .. ESTa +1^j -EFT,+1  Inputting m = S in equation [4.11] we find that it is half of equation [4.25] which proves the statement made in the previous paragraph.  Condition 2: The shift S, of the activity is equal to or greater than the duration T of the activity.  For this case, the value of m equals the duration, T, of the activity. That is, m = T  x (ESTa +2) ^ Let x (EsTa +i),^ 1  1 X (ESTa+T)  be the set of daily resource aggregates,  from which k = m = T resource rates, r1 , r2 ,.... , rr , are to be deducted, respectively. In Figure 4.3, this is represented by the cross-hatched area on the left side which is marked as 'I'. j • • EFTa [ X1 ] ••^  E^x;  J.- ESTa +1  [4.26]  Chapter 4. The Modified Minimum Moment Algorithm ^  59  variable resource rate, co for activity nee  resource rates 'rk'  r2 S la b re resource profile  r7  r  :  Tama  ESTa =1  EFTa = 9 shift S := 10.  daily resource aggregates 'x : ^ 1  x  project d ay 'j'  2  time  —  --  Il  2  x 3  3  x  4  4  x  5  5  x  6  6  x 7  7  x  8  8  x 9 9  ^x x14 14 15 18 x17 )i8 0  11  Is  12 13 14 15 16 17 18 19  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 project resource histogram with cross-hatched area representing portions of the histogram affected due to the shift of activity ma° Figure 4.3 Shifting activity with variable resource usage profile (S z T)  ^  Chapter 4. The Modified Minimum Moment Algorithm ^  60  The corresponding set of daily resource aggregates after the shift will be, j—EFT,, k—T  j-EST.+1, k-1  Also x (Es2,a .s+i) • x (EsTa +s+2) • ^  (xi - r k )  X (EST.+S+T— EFTa+S)  [4.27]  is the set of daily resource  aggregates, to which k = m = T daily resource rates, rp r2,....., r7, are to be added, respectively. In Figure 4.3, this set is represented by the cross-hatched area on the right side which is marked as 'II'. j—EFT,+S X2^  j—ESTa +S+1  xi^  [4.28]  The corresponding set of daily resource aggregates after the shift will be,  ^xx2  ^j—EFTa +S, k—T  ( xi r  k  )  ^  [4.29]  j—EST,+S+1, k-1  The portion of the histogram that will be affected by the shift of the activity is cross-hatched in Figure 4.3. The remaining area will not contribute to any change of the histogram moment and therefore can be neglected.  ^j  Chapter 4. The Modified Minimum Moment Algorithm ^  61  Thus, the moment of the resource histogram before shifting the activity will be the sum of the squares of [Xi] and /X2J, respectively. Therefore, j —EFT,^j — EFT a + S  E j —EST  Mi. _  ^E +1^j —EST.+ S+1 2 +  a  X. .7  2  [4.30]  Xi  Similarly, the moment of the histogram after the activity shift will be the sum of the squares of pg(il and pfxj, respectively. Therefore,  —  EFT M2 "•^  ^j — EST  a,  k T^j — EFT a + S , k T —  —  (x_I-Ek) E^ E^(xi 4- rid +1 , k-1^j —EST + S+1 , 1&1 2  +^  a  Improvement in the histogram moment will result only when  ^j —EFT ^j —EST  a,  2^[4.31]  a  M2 s M1.  Therefore,  k—T^ j—EFTa+S, k T  (x -r E+1 , k-1^j —EST i  id 2 +  a  j —EFT a  E J-ESTa + 1  —  ^  E^(x_i 4- rk) 2 S+1 , k-1  s  a+  j — EFT a + S  E^xJ•  2^ +^ XJ  j -EST a + S+1  2  [4.32]  ^  ^j  Chapter 4. The Modified Minimum Moment Algorithm ^  62  From the above expression we get, j EFTa^k•• T  j —EFTa , k—T^j —EFTa +S  E^.4 4- E  .rl 2 xir k +^ j—EST a + 1^k:•1 . n ESTa +1 , k•fll^j --ESTa +S+1  .k.•T  +T  -1  E  —  Xj  j —EFTa + S , k•• T 2  r k + 2^E^Ajrk  s  j —ESTa + S+1 , k.-1  j — EFTa  E  j —EFTa +S  +^E  2  j.•ESTa +1  X.3-  2  j —ESTa +S+1  [4.33]  XJ•  Rearranging the terms, we get, k—T 2 2^rk 1  j —EFTa , .1( T 2^ xirk j ESTa +1 , k 1  E^  +  -  j • • EFTa + S , k—T 2^  E^Altrk^s^0  j-ESTa +S+1, k-1  [4.34]  Dividing by -1,  T  k—T  -  2  -1  2  rk +  j — EFTa , k—T 2^ j—ESTa +1, k-1  E^xi r k —  j EFTa +S, k T 2^ x.irk 2 0 j —ESTa +S+1 , k-1 -  -  E^  [4.35]  In the above expression the left side portion is called the improvement factor.  ^ ^  63  Chapter 4. The Modified Minimum Moment Algorithm^  Therefore, for any activity, a, with shift S, and S T, the improvement factor, IF, is:  T  k—T^j —EFT., k—T  ^IF (a, S)  2 rl. + 2^E^xirk ^-1^j=EST.+1, .101 —  —  j-EFTa+S, k-T ^[4.36] - 2^ xirk  E^  j—EST.+S+1, k-1  Because of division by -1 in the derivation, the improvement factor must always have a positive value in order to reduce the moment of the histogram. Also, if the improvement factor of an activity with constant resource rate is calculated using this procedure, it will be twice the value obtained using the expression for IF derived for the constant resource profile at the activity level (equation [4.11]). Letting rk = r, for k = 1, 2, , T, the improvement factor as obtained from equation [4.36] reduces to:  j —EFT.^j—EFT.+S  IF (a,S) - 2r  E  xi -  E  j-ESTa +1^j-ESTa+S+1  xi  - Tr ) [4.37]  Inputting m = T in equation [4.11] and making some transformations we find that it is half of equation [4.36] which proves the statement made in the previous paragraph.  Chapter 4. The Modified Minimum Moment Algorithm^  64  4.4 THE CONCEPT OF BACK FLOAT  The concept of back float as introduced by Harris (22) is necessary to understand because, during the backward pass of the algorithm, the maximum limit of the shift for any activity is defined and limited by the back float.  Assuming an early start schedule the non-critical activities can be scheduled within a range of times which will depend on the finish dates of its predecessors and the start dates of its successors.  An activity can start once all its predecessors are finished, i.e. the latest of the early finish dates of its predecessor activity controls its early start date, for the case of non-overlapping relationships. In the same way the earliest of the early start dates of its successors will control its early finish date. If the activity starts at its earliest, then, the period between its actual finish date and the earliest of the early start dates of its successors is called the Free Float of the activity. If shifted, the activity may consume a part or the full amount of its free float. Similarly, when the activity is scheduled at its late finish date, the free float reduces to zero. The period between the latest early start date and the latest of the early finish dates of its predecessors is called the Back Float.  Therefore, back float for any activity is the difference between its start date and the latest of the early finish dates of its predecessors. Thus, for any activity, a, with n predecessors, the back  65  Chapter 4. The Modified Minimum Moment Algorithm ^  float, BF„, is defined as, BF, — EST, —  max vn EFTn  [4.38]  where, the latter half of the right hand side of the above equation corresponds to the predecessor activity which has the latest early finish date.  The concept of Back Float has been extended for treating the precedence relationships of types FS, SS, FF and SF. These relationships have been discussed individually and are presented  below.  FS precedence relationship: For an activity, a, having FS precedence relationship with its n  predecessors, the back float, BF., is defined as, BFa — ESTa —Max Vn [EFT„  + FS„]  [4.39]  where, FS represents the activity's lag value and the latter half of the right hand side of equation [4.39] corresponds to the predecessor activity which produces the maximum sum (EFT. + FS.).  SS precedence relationship: For an activity, a, having SS precedence relationship with its n  predecessors, the back float, BF., is defined as,  66  Chapter 4. The Modified Minimum Moment Algorithm ^  BFa - ESTa - Max V n [ESTn + SSn ]  [4.40]  where, SS represents the activity's lag value and the latter half of the right hand side of equation [4.40] corresponds to the predecessor activity which produces the maximum sum (EST„ + SS.).  FF precedence relationship: For an activity, a, having FF precedence relationship with its n  predecessors, the back float, BF., is defined as, vanX [EFTa + FFn ] BFa - EFTa - M  ^  [4.41]  where, FF represents the activity's lag value and the latter half of the right hand side of equation [4.41] corresponds to the predecessor activity which produces the maximum sum (EFT„ + FF.).  SF precedence relationship: For an activity, a, having SF precedence relationship with its n  predecessors, the back float, BF,„ is defined as,  BFa - EFTa  -%  X  [EST„+ SFn ]  ^  [4.42]  Chapter 4. The Modified Minimum Moment Algorithm ^  67  where SF represents the activity's lag value and the latter half of the right hand side of equation [4.42] corresponds to the predecessor activity which produces the maximum sum (EST„ + SF„).  4.5 SEQUENCE STEP NUMBERS  'A sequence step may be defined as the earliest logical position in the network that an activity can occupy while maintaining its proper dependencies" Harris(22).  The purpose of this section is to introduce "sequence step numbers" in reference to multiple location activity types as found in the REPCON environment for linear scheduling.  Ordered Activity: Locations of an ordered activity all have a different sequence step number.  Given an ordered set of locations 12 , 12 , .... , /k „ l„ for activity a with n locations, then the sequence step number for location /k+i is at least one greater than that for location /k , i.e., SSNik.,  2^SSNlk + 1  ^  [4.43]  Continuous Activity: All locations of a continuous activity have the same sequence step number.  Given a continuous set of locations 11 , /2 , .... , lk SSN/i  -  „ 4,  SSN12 - SSAT/ k  -  for activity a with n locations, then, SSNI .^  [4.44]  Chapter 4. The Modified Minimum Moment Algorithm ^  68  Shadow Activity:^The sequence step number for each location of a shadow activity is equal to one greater than its governing predecessor sequence step number.  4.6 WEIGHTING SCHEME FOR RESOURCES When using the modified minimum moment algorithm for the multiple resource case, one approach is to assign weights to the different resources using some priority weighting scheme and then to sum up the weighted resources to get an aggregate resource usage profile for the project. Only a simple resource weighting scheme has been included to date. It involves the user assigning a weight to the resource varying from 0 to oc. The default is 1. Each resource is multiplied by its weight factor when aggregating resources to generate the histogram and computing improvement factors.  Weighting schemes along the lines suggested by Harris (22) should be explored in the future. However, there may be considerable computational time involved because of the following steps in the weighting scheme. First, for each resource, the differences in the daily resource aggregates on a day-by-day basis for the project duration have to be computed to obtain the relative weight of each resource. Second, each resource profile must be factored by their respective weights to get an aggregated resource profile at the start of the leveling operation. Third, at the completion of the leveling operation, histograms for each resource contributing to the aggregated resource profile have to be recomputed using the resource level assigned to get the profiles for individual resources. As the number of resources increases, the time  Chapter 4. The Modified Minimum Moment Algorithm ^  69  required to derive the weightings are considerable. For the Harris procedure, these weightings are computed only once. A case could be made for their recomputation at different intervals in the leveling process to take account of shifts in the resource profile shape.  4.7 A BRIEF REVIEW OF THE HARRIS MINIMUM MOMENT ALGORITHM  As a first step toward developing a more generalized minimum moment algorithm, we first review the basic algorithm set out by Harris (22). The algorithm is applicable to the case of constant resource usage at the activity level (i.e., rk = r for k =1, 2, ^, 7). To commence the leveling procedure, network computations are made and early start and finish times for every activity are established along with sequence step numbers. Free Float is determined for every activity and the critical path is identified. The resource to be leveled is selected and the usage amount required for each activity is assigned. The daily resource aggregates are obtained by assuming that all activities start at their EST. The maximum possible amount by which any activity can be shifted is equal to its Free Float. The leveling procedure begins with a forward pass with activities on the last sequence step. Improvement factors for all possible shifts of all activities on this sequence step are calculated. The activity with the largest improvement factor is chosen and the shift is made. If there is a tie in improvement factors between two or more activities, then the selection of the activity is made based on a set of heuristic rules. If the activity has the same maximum improvement factor for more than one shift position, then the activity is shifted by the maximum amount. Free Floats, EST and EFT are updated if shifting has taken place. This procedure is repeated until all activities on this sequence step are  Chapter 4. The Modified Minimum Moment Algorithm^  70  processed and no further shift is possible. The procedure then moves to the next earlier sequence step. The above approach is repeated for all activities on this sequence step. The process continues until the first sequence step is reached.  The backward pass then starts. The Back Floats for all activities are determined. The back pass process starts with the activities on the first sequence step. The same procedure is adopted as in the forward pass, except that Back Float is used instead of Free Float and the activities move backwards now. The process continues until the last sequence step is reached. The original algorithm as stated by Harris is presented below:  Setup A.  Prepare an arrow or precedence network of the project and determine the sequence step number for each activity.  B.  Prepare a link matrix and compute the ESD and EFD for each activity. Compute the lags for each link. Determine the total float for each activity and identify the critical path.  C.  Select a resource to be leveled.  D.  Determine the amount of the selected resource which is required per day for each network activity. Call this required resource rate, "r."  E.^Prepare a bar chart showing the early start time for each activity and its duration. Plot critical activities first, followed by noncritical activities.  Chapter 4. The Modified Minimum Moment Algorithm ^  71  F.^For each day of the project, total the resource rates at the foot of the bar chart to obtain the daily resource sums.  Procedure The procedure begins with the activities on the last sequence step. 1.^Examine activities on the sequence step. (a)  Every activity on the sequence step having zero free float is passed over.  (b)  Every activity on the sequence step having a zero resource rate is shifted to the limit of the activity free float to allow preceding activities to be shifted.  (c)^For each activity on the sequence step having a positive resource rate, determine the extent of its free float and compute improvement factors for all possible days that the activity can be shifted until the free float limit is reached.  2.^Select the activity having the largest improvement factor determined in algorithm step 1(c). (a)  If the largest improvement factor is negative, no shifting takes place. Go to the next sequence step and examine the activities as in algorithm step 1.  (b)  If there is a tie in the value of the largest improvement factor for several activities: (i)  Select the activity with the greatest "r" value.  (ii)  If still tied, select the activity which creates the greatest free float for  Chapter 4. The Modified Minimum Moment Algorithm ^  72  preceding activities.  00 (iv)  ^  ^  If still tied, select the activity with the latest start date.  If still tied, select the first activity in the queue.  3.^Shift the selected activity subject to the following: (a)  If the largest improvement factor is zero or positive, shift the selected activity by subtracting the activity resource rate being vacated and adding this same rate to each of the daily resource sums at the position being occupied.  (b)  If there is a tie in the value of the improvement factor at several of the possible activity positions, shift the activity the greatest number of time units.  4.^If shifting has occurred in algorithm step 3, update the lags, ESD and EFD, in the link matrix.  5.  Reexamine the activities on the sequence step and repeat algorithm steps 1 through 4 until all shifting is complete on this step.  6.  Examine the next earlier sequence step and repeat algorithm steps 1 through 5. Continue in this manner until all activities have been considered and all possible shifting has taken place on every sequence step.  Chapter 4. The Modified Minimum Moment Algorithm^  7.  73  Repeat algorithm steps 1 through 6 until no further shifting takes place. This is the end of the forward cycle.  8.  Beginning with the first sequence step, using back float instead of free float, and progressing to the next latest sequence step instead of to the next earliest sequence step, repeat algorithm steps 1 through 7 until all activities have been considered and shifted, where possible, to an earlier time position. This is the end of the backward cycle and completes the leveling.  4.8 REFINEMENTS AND MODIFICATIONS TO THE BASIC MINIMUM MOMENT ALGORITHM FOR LINEAR SCHEDULING AND VARIABLE RESOURCE USAGE  The following refinements and modifications have been made in the Harris Minimum Moment Algorithm. 1)^The scope of the basic algorithm has been extended to include activities which consume resources at a variable rate over their duration. With reference to linear scheduling as implemented within the REPCON environment, activity types of shadow, ordered and continuous, with multiple locations and variable resource usage profile can be dealt with. For continuous activities, all locations must move - i.e., a continuous activity behaves as a single large activity spanning over several locations.  Chapter 4. The Modified Minimum Moment Algorithm ^  2)  74  New rules have been added to take care of activities with multiple locations. If the  activities with multiple locations are tied for shifting then they are shifted with respect to their location execution sequence. For a shadow activity the last location of it is selected first during the forward pass shift and the first location in the activity location sequence is selected first during the backward pass shift. This has been done to ensure that the work progresses in a rational way in terms of location sequence execution. However, inclusion of this rule does not always guarantee the above solution because the selection of an activity for shifting and its shift amount is primarily controlled by the improvement factor produced by the respective shift. Continuous activity acts as a single large activity spanning over several locations. Therefore when required to shift, all of its locations are moved as an unit. For an ordered activity  individual locations can be shifted independently while maintaining their precedence relationships with other locations.  3)  Modifications have been made in some heuristic rules which are used to break the tie  between activities which have the same improvement factor value. The purpose of these modifications is to increase the computational efficiency of the modified algorithm. The rule in the basic minimum moment algorithm which states "shift the activity which creates the greatest free float for preceding activities" has been changed to "shift the activity with greatest free float". With the original rule increased free float has to be calculated for every predecessor of the tied activities. This requires considerable computational effort and time. Therefore, this rule change has been made to save on computation time.  Chapter 4. The Modified Minimum Moment Algorithm ^  75  4)^Step number 7 of the basic minimum moment algorithm has been deleted. Due to this fact, for any network there is only one Forward Pass and one Backward Pass. This has been done in order to save on computation time.  Because of this modification it may happen that a few activities may not be shifted to the fullest extent possible during the forward pass and similarly they may not be shifted backward by the fullest extent possible during the backward pass. This change may produce different results when compared to the results produced by the original minimum moment algorithm.  4.9 THE MOD& IED MINIMUM MOMENT ALGORITHM FOR RESOURCE LEVELING  The Modified Minimum Moment Algorithm for resource leveling is presented below along with the reasoning for the heuristic rules where they apply. The algorithm has been presented separately for both problems classes, i.e., for activities involving constant resource usage and for those involving variable resource usage. Multiple resource conditions have been assumed which means that the resources are aggregated and leveled in a single run. This aggregation may be based on the natural resource weighting or the respective resource weight factors may be assigned by the user.  There are certain prerequisites to be completed before applying the minimum moment algorithm, given the network plan.  Chapter 4. The Modified Minimum Moment Algorithm ^  76  i)  The sequence step numbers of all the locations of activities must be determined.  ii)  EST and EFT for each activity are determined and the lags for each network link are then computed. The critical path of the network is identified.  iii)  A "Resource leveled dates record" is created which contains the Leveled Start and Finish Times of all activities including their Leveled Lags (from which Leveled Free and Back Floats are derived). Initialize the Leveled Start and Finish Times for all activities with their EST and EFT times. Similarly initialize the Leveled Lags with the Lags at the start of the leveling procedure. Also initialize the Leveled Free Floats with the Free Floats of the corresponding activities. Back Floats for all activities are initialized to 0.  iv)  Resources to be leveled are identified.  v)  Resources and their usage profiles must be assigned to the activities.  vi)  Using the assigned weight factors for different resources of the same class (default is 1.0 for all resources), the resources for individual activities on all activity days are summed up, respectively, to obtain an aggregated resource usage profile. If the activity has a constant resource usage rate, then it is referred to as the required resource usage rate, r. For an activity with a variable resource usage profile, the resource rates are identified by rk , where the subscript k refers to the day of the activity and its value ranges from 1 to T, where T is the duration of the activity. The total resource consumption for the  activity is determined by summing up the different resource usages on all activity days. This is referred to as activity resource consumption and is denoted by XRESO. This is  Chapter 4. The Modified Minimum Moment Algorithm^  77  done for all activities. vii) Daily resource aggregates for each day of the project are obtained by summing up the resources consumed by the scheduled activities on the respective days.  4.9.1 Modified Minimum Moment Algorithm for Problems involving Activities with Constant Resource Usage  The shifting procedure is divided into forward pass and backward pass steps. As mentioned earlier, in the forward pass, the activities are shifted forward in the range of their free floats and during the backward pass they are shifted backwards in the range of their back floats, in order to minimize the resource histogram area and achieve a leveled resource profile.  Forward Pass  The shifting procedure commences with the activities on the last sequence step. 1.^Examine activities on the current sequence step. (a)  Every activity with zero free float as well as milestone and hammock activities are skipped. (Not addressed in this work is the potential for the lengthening of hammock activities due to leveling. This could be important if resources are assigned to the hammock activity).  (b)  Every activity having a zero resource usage rate is shifted to the limit of its free float. This allows the preceding activities to be shifted by the greatest amount  Chapter 4. The Modified Minimum Moment Algorithm^  78  (within the free float constraint). (c)^For each activity on the step having a non-zero resource usage rate, determine its free float and improvement factors for all possible days that the activity can be shifted until the free float limit is reached.  2.^Select the activity with the largest improvement factor as determined in the previous step. (a)  No shifting takes place if the largest improvement factor is negative. Move to the next sequence step and examine the activities as in step 1.  (b)  If there is a tie in the value of the largest improvement factor for several activities: (i)  Move to (ii) if no shadow activity is involved. For the case of a shadow activity, keep the location with the highest location index number for further comparisons while discarding its other locations. (This rule tries to ensure that location execution sequence for a shadow activity follows the pattern of the project's sequence of locations.)  (ii)  Select the activity with the greatest "r" value. (Thus, preference is given to eliminate the excess peaks of the resource histogram. Along with the achievement of minimum histogram moment we also achieve the objective of minimum hiring of resources on  Chapter 4. The Modified Minimum Moment Algorithm ^  79  the project days vacated by the activity.) (iii)  If still tied, select the activity with the greatest Free Float. (The idea here is to generate increased free float for predecessor activities, assuming that the activity has noncritical activities as its predecessors.)  (iv)  If still tied, select the activity with the latest resource leveled start date. (An arbitrary rule to select an activity.)  (v)^If still tied, select the activity with the smallest activity code. (This is an arbitrary rule to break a tie - each activity has a unique code.)  3.^Shift the selected activity subject to the following: (a)  If the largest improvement factor is zero or positive, shift the selected activity by subtracting the activity resource usage rate from each of the daily resource aggregates at the position being vacated and adding the same rate to each of the daily resource aggregates at the position being occupied.  (b)  If there is a tie in the value of the improvement factor at several of the possible activity positions, shift the activity the greatest number of time units. This would allow the preceding activities to be shifted by a greater amount. Update the daily resource aggregates field as described in 3(a).  4.^If shifting has occurred in step 3, update the "Resource leveled dates record" (i.e., Leveled Start and Finish Times, Leveled Free Float and Free Float for all the  Chapter 4. The Modified Minimum Moment Algorithm ^  80  predecessors of the shifted activity).  5.  Re-examine the activities on the sequence step and repeat steps 1 through 5 until all shifting is complete on this step.  6.  Examine the next earlier sequence step and repeat steps 1 through 5. Continue in this manner until all activities have been considered and all possible shifting has taken place on every sequence step.  Backward Pass The shifting procedure commences with the activities on the first sequence step. 7.^Examine activities on the current sequence step. (a)  Every activity with a zero back float as well as milestone and hammock activities are passed over.  (b)  Every activity having a zero resource usage rate is shifted to the limit of the activity back float. This allows succeeding activities to be shifted by the greatest amount (within the back float constraint).  (c)^For each activity on the step having a non-zero resource usage rate, determine the extent of its back float and compute improvement factors for all possible days that the activity can be shifted until the back float limit is reached.  Chapter 4. The Modified Minimum Moment Algorithm ^  81  8.^The activity with the largest improvement factor as determined in the previous step is selected. (a)  If the largest improvement factor is negative, no shifting takes place. Move to the next sequence step and examine the activities as in step 7.  (b)  If there is a tie in the value of the largest improvement factor for several activities: (i)  Move to (ii) if no shadow activity is involved. For the case of a shadow activity, keep the location with the lowest location index number for further comparisons while discarding its other locations. (This rule tries to ensure that the location execution sequence for a shadow activity follows the sequence order of the project's locations.)  (ii)  Select the activity with the greatest "r" value. (Thus, preference is given to eliminate the excess peaks of the resource histogram. Also, along with the achievement of minimum histogram moment we also achieve the objective of minimum hiring of resources on the project days vacated by the activity.)  (iii)  If still tied, select the activity with the greatest Back Float. (The idea here is to generate increased back float for successor activities, assuming that the activity has noncritical activities as its successors.)  (iv)  If still tied, select the activity with the latest resource leveled start date. (An arbitrary rule to select an activity.)  Chapter 4. The Modified Minimum Moment Algorithm ^  82  (v)^If still tied, select the activity with the smallest activity code. (This is an arbitrary rule to break a tie - each activity has a unique code.)  9.^Shift the selected activity subject to the following: (a)  If the largest improvement factor is zero or positive, shift the selected activity by subtracting the activity resource usage rate from each of the daily resource sums at the position being vacated and add this same rate to each of the daily resource sums at the position being occupied.  (b)  If there is a tie in the value of the improvement factor at several of the possible activity positions, shift the activity the greatest number of time units. Update the daily resource aggregates field as described in 3(a).  10.^If shifting has occurred in step 3, update the "Resource leveled dates record" (i.e., Leveled Start and Finish Times, Leveled Back Floats and Back Float for all the successors of the shifted activity).  11.^Re-examine the activities on the sequence step and repeat steps 7 through 10 until all shifting is complete on this step.  12.^Examine the next later sequence step and repeat steps 7 through 11. Continue in this manner until all activities have been considered and all possible shifting has taken place  Chapter 4. The Modified Minimum Moment Algorithm ^  83  on every sequence step. This is the end of the backward cycle and completes the leveling operation.  4.9.2 Modified Minimum Moment Algorithm for Problems involving Activities with Variable Resource Usage  Again the shifting procedure is divided into a forward pass and a backward pass operation. In the forward pass, the activities are shifted forward in the range of their free floats and during the backward pass the activities are be shifted backwards in the range of their back floats, in order to minimize the resource histogram area and achieve a leveled resource profile.  Forward Pass  The shifting procedure begins with the activities on the last sequence step. 1. Examine activities on the current sequence step. (a) Every activity with zero free float as well as milestone and hammock activities are skipped. (b) Every activity having a zero resource usage rate is shifted to the limit of its free float. This allows the preceding activities to be shifted by the greatest amount (within the free float constraint). (c) For each activity on the step having a non-zero resource usage rate, determine the extent of its free float and compute improvement factors for all possible days that the activity can be shifted until the free float limit is reached.  Chapter 4. The Modified Minimum Moment Algorithm ^  84  2.^Select the activity with the largest improvement factor as determined in the previous step. (a) No shifting takes place if the largest improvement factor is negative. Move to the next sequence step and examine the activities as in step 1. (b) If there is a tie in the value of the largest improvement factor for several activities: (i)  Move to (ii) if no shadow activity is involved. For the case of a shadow activity, keep the location with the highest location index number for further comparisons while discarding its other locations.  (ii) Select the activity which utilizes the greatest number of resources over its duration i.e., the greatest activity resource consumption ERESO. (Thus for two activities with the same duration but with different total resource consumption, the activity with the greater resource consumption would give a greater reduction in resource levels on the days being vacated. An alternate choice to this rule has been suggested in chapter 6.) (iii) If still tied, select the activity with the greatest Free Float. (iv) If still tied, select the activity with the latest resource leveled start date. (v) If still tied, select the activity with the smallest activity code.  3.^Shift the selected activity subject to the following: (a) If the largest improvement factor is zero or positive, shift the selected activity and subtract the activity resource rates, rk ( k = 1,2, from each of the daily resource aggregates at the position being vacated, respectively, and adding the same  Chapter 4. The Modified Minimum Moment Algorithm ^  85  rates to each of the daily resource aggregates at the position being occupied, respectively. (b) If there is a tie in the value of the improvement factor at several of the possible activity positions, shift the activity the greatest number of time units. Update the daily resource aggregates field as described in 3(a).  4.  If shifting has occurred in step 3, update the "Resource leveled dates record" (i.e., Leveled Start and Finish Times, Leveled Free Float of the shifted activity and Leveled Free Float of all the predecessors of the shifted activity).  5.  Re-examine the activities on the sequence step and repeat steps 1 through 4 until all shifting is complete on this step.  6. Examine the next earlier sequence step and repeat steps 1 through 5. Continue in this manner until all activities have been considered and all possible shifting has taken place on every sequence step.  Backward Pass The shifting procedure commences with the activities on the first sequence step. 7.^Examine the activities on the current sequence step.  Chapter 4. The Modified Minimum Moment Algorithm ^  86  (a) Every activity with zero back float as well as milestone and hammock activities are passed over. (b) Every activity having a zero resource usage rate is shifted to the limit of the activity back float. This allows the succeeding activities to be shifted by the greatest amount (within the back float constraint). (c) For each activity on the sequence step having a non-zero resource usage rate, determine the extent of its back float and compute improvement factors for all possible days that the activity can be shifted until the back float limit is reached.  8. Select the activity with the largest improvement factor as determined in the previous step. (a) If the largest improvement factor is negative, no shifting takes place. Move to the next sequence step and examine the activities as in step 7. (b) If there is a tie in the value of the largest improvement factor for several activities: (i)  Move to (ii) if no shadow activity is involved. For the case of a shadow activity, keep the location with the lowest location index number for further comparisons while discarding its other locations.  (ii) Select the activity which utilizes the greatest number of resources over its activity duration i.e., the greatest activity resource consumption /RES°. (iii) If still tied, select the activity with the greatest Back Float. (iv) If still tied, select the activity with the latest resource leveled start date. (v) If still tied, select the activity with the smallest activity code.  Chapter 4. The Modified Minimum Moment Algorithm ^  87  9.^Shift the selected activity subject to the following: (a) If the largest improvement factor is zero or positive, shift the selected activity and subtract the activity resource rates, rk (k = 1,2, ^ 1), from each of the daily resource aggregates at the position being vacated, respectively, and adding the same rates to each of the daily resource aggregates at the position being occupied, respectively. (b) If there is a tie in the value of the improvement factor at several of the possible activity positions, shift the activity the greatest number of time units. Update the daily resource aggregates field as described in 3(a).  10. If shifting has occurred in step 3, update the "Resource leveled dates record" (i.e., Leveled Start and Finish Times, Leveled Back Float of the shifted activity and the Leveled Back Float of all the successors of the shifted activity).  11. Re-examine the activities on the sequence step and repeat steps 7 through 10 until all shifting is complete on this step.  12. Examine the next later sequence step and repeat steps 7 through 11. Continue in this manner until all activities have been considered and all possible shifting has taken place on every sequence step. This is the end of the backward cycle and completes the leveling operation.  ss  Chapter S EXAMPI PS  5.1^Introduction In this chapter examples have been worked out using the Modified Minimum Moment Algorithm. The first four examples presented were taken from the literature on resource leveling and were discussed in chapter 3. These examples were used to validate the implementation of the modified minimum moment algorithm and to compare its results with other approaches. A small number of examples are presented for linear projects. The linear scheduling examples have been designed to provide insight on how the leveling procedure behaves when confronted by flow lines. A measure of goodness for the leveling procedure, called the resource improvement coefficient (RIC) by Harris (22) has been computed both for the early start time and resource leveled histogram for each problem. RIC is the ratio of the moment of actual histogram to the hypothetical minimum moment histogram (perfectly uniform resource usage) and is given by the formula:  n E yi2 RIC - ^ )92  (E  [5.1]  where, yi , represents the resource demand on day i of the project and the summation is over the n intervals covered by the histogram. In this chapter the value of n will always be assumed to be equal to the project length (This is the definition used in the modified minimum moment algorithm).  Chapter 5. Examples^  89  Example 5.1: Burman Example (10) The network diagram for this example was given in Figure 3.1. Figure 5.1 shows the early start and leveled resource histograms. The resource leveled histogram obtained using Burman's approach (3.3) has also been superimposed on Figure 5.1. Appendix A gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling. Resource improvement coefficient values for the various resource profiles are as follows: RIC - EST Schedule = 1.2009 RIC - Modified Minimum Moment Algorithm = 1.1756 RIC - Burman's method = 1.1836  Two observations are made. First, given the small size of the problem, the opportunity for significant shifting of activities is small. Second, the minimum moment approach provides better results than Burman's approach.  4. /X „e, 1  2  /// /A4Z^, 4///,/A;, /4/4^ 3  4  5  10^11^12^13^14^15  6  111 after leveling^^ before leveling^F  .^t /1, z  ,  Burman's solution 0 critical resources  Figure 5.1 Resource histograms before and after leveling - example 5.1, Burman (10)  Chapter 5. Examples^  91  Example 5.2: Harris Example (Packing Method (23)) The network diagram for this example was given in Figure 3.2. Figure 5.2 shows the early start and leveled resource histograms. It should be noted that the result obtained using Harris's Packing Method (3.5) is exactly the same as obtained through the use of Modified Minimum Moment Algorithm. Appendix B gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling. Resource improvement coefficient values for various resource profiles are as follows: RIC - EST Schedule = 1.5527 RIC - Modified Minimum Moment Algorithm = 1.1056 RIC - Harris's Packing method = 1.1056  16 — R 14 —  e  s 12 —  0  10 —  r  8  n  •  6 4  t  . s .^ 2 0 1^2^3^4^5^  6^7^8 iProject!  9  10  11  12^13^14^15^16  in after leveling^^ before leveling^critical resources Figure 5.2 Resource histograms before and after leveling - example 5.2, Harris (22)  Chapter 5. Examples^  93  Example 53: Easa Example (18) The network diagram for this example has been given in Figure 3.3. Figure 5.3 shows the early start and leveled resource histograms. It should be noted that the result obtained using Easa's method (3.6) is exactly the same as obtained through the use of Modified Minimum Moment Algorithm. Appendix C gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling. Resource improvement coefficient values for resource profiles are as follows: RIC - EST Schedule = 1.0491 RIC - Modified Minimum Moment Algorithm = 1.0113 RIC - Easa's method = 1.0113  14 12 010 r 8 6 n 4  t  1  2  3  4  :Pi Ojëefiday.: -  after leveling  ^ before leveling  critical resources  Figure 5.3 Resource histograms before and after leveling - example 5.3, Easa (18)  5  Chapter 5. Examples^  95  Example 5.4: Antill and Woodhead Example (3) The network diagram for this example was given in Figure 3.4. Three types of resources are involved - Manpower, Equipment A and Equipment B. The three resources have been summed up for each activity to get the aggregate resource profile. The leveling operation is then performed on the combined resources. Figure 5.4 shows the early start and leveled resource histograms. The resource leveled histogram obtained using Antill and Woodhead's approach (3.7) has also been superimposed on Figure 5.4. Appendix D gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling. Resource improvement coefficient values for the various resource profiles are as follows: RIC - EST Schedule = 1.1736 RIC - Modified Minimum Moment Algorithm = 1.0193 RIC - Antill and Woodhead's method = 1.0131  From Figure 5.4 it can be observed that the peak values using the Antill & Woodhead's method is less, accounting for the slightly better RIC value. Although not done, a second iteration (another forward and backward pass) using the modified minimum moment algorithm may be worth considering.  1^2^3^4^5^6^7^8^9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25  ti After leveling  ^ ^  before leveling^Antill & Woodhead's 4 critical resources solution  Figure 5.4 Resource histograms before and after leveling - example 5.4, Antill & Woodhead (3)  Chapter 5. Examples^  97  Example 5.5: Original Harris Minimum Moment Algorithm Example (22)  This example has been adopted from Harris (22). The network diagram, early start schedule and the resource details are shown in Figure 5.5. The leveling operation has been performed on two resources - Resource 1 and Resource 2. Three cases have been considered. Case 1: Resource leveling for Resource 1 only, Case 2: Resource leveling for Resource 2 only and Case 3: Resource leveling for combined resources i.e., Resource 1 + Resource 2.  Figure 5.6 shows the early start and leveled resource histograms for case 1 - i.e., resource leveling for Resource 1 only. The resource improvement coefficient values are as follows: RIC - EST Schedule = 1.4914 RIC - Modified Minimum Moment Algorithm = 1.1506 The solution was identical to Harris's solution.  Figure 5.7 shows the early start and leveled resource histograms for case 2 - i.e., resource leveling for Resource 2 only. The resource improvement coefficient values are as follows: RIC - EST Schedule = 1.9169 RIC - Modified Minimum Moment Algorithm = 1.1667 Harris does not give the resource profile for leveling resource 2 only but gives the resource improvement coefficient value for this case. RIC value obtained from Modified Minimum Moment Algorithm is found to be the same as from Harris's minimum moment algorithm.  Figure 5.8 shows the early start and leveled resource histograms for case 3 - i.e., resource  Chapter 5. Examples^  98  leveling for combined resources, Resource 1 + Resource 2. Resource improvement coefficient values are as follows: RIC - EST Schedule = 1.6809 RIC - Modified Minimum Moment Algorithm = 1.1622 Resource improvement coefficient values when compared to that obtained by Harris are found to be the same.  Appendix E gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling for all three cases.  ^  early start time^()arty finish time  14  2  activity number  1 12 14  5  I.  I  ii  F7  ?I  1 6 1_ 2  3  resource 2 resource 1 duration  critical path  Sample activity  O 12 A2  0 12 12  010  ^  ST 1 01010  15  ^  5 1 11  -••■--011.  21513  ^C  ^ O 13 ^ 4 ^ 2 13 10  3  4 I 215  ^  18 12  3  ^ 9 1^  17  -O.  ^  ^rill... L 11  G8  3  1 10  8  K 10  ^Ow" B 3 ^ ^IMP" F 7 ^  ^  ^0  O  21 8 E 6 21815  21 710  18  ^III►  1 20  P 14  0 2 0  9 1 12 M 12 2 13 18  ^  I  H 9  1 41- 5^  ^  r  4  1  -  2 13  Figure 5.5 Network for resource leveling with two resources; example 5.5, Harris (22)  S  R 12 e s o 10 u r c e  1  2^3^4^5^6^7^8^9^10^11 I I ;I:11 , ;10 , 00!!!! ,! [, 1 1 " 111. ,  12^13^14^15^16^17^18^19^20  , tojeot:1140 ,  ,;:a11,1„,.,m1„„„„:„,„„„„,.  VI after leveling^^ before leveling  critical resources  Figure 5.6 Resource histograms before and after leveling - Resource 1; example 5.5, Harris (22)  g  18 — R 16 — e s 14 — 0 u 12 — r c 10 — e  8—  1^2^3^4^5^6^7^8^  9^10^11  . rojec  12^13^14^15^16^17^18^19^  II after leveling^^ before leveling ^critical resources Figure 5.7 Resource histograms before and after leveling - Resource 2; example 5.5, Harris (22)  20  35 — e  30 —  o 25 — u r 20 — c e  15 —  u n 10 — t 1  ••••• •••••••^  v''  1^2^3^4^5^6^7^8^9^10^11^12^13^14^15^16^17^18^19^20 loor TOW PIIPoi 0j: after leveling^^ before leveling^A critical resources Figure 5.8 Resource histograms before and after leveling - Resource 1 + Resource 2; example 5.5, Harris (22)  Chapter 5. Examples^  103  Example 5.6: Clough and Sears Example (15)  This example has been adopted from Clough and Sears (15). The network diagram for this example has been given in Figure 5.9. Three types of resources are involved - Carpenters, Labourers and Equipment operators. All three resources have been summed up to get an aggregated resource profile for the project. The leveling operation is then performed on the combined resources. Figure 5.10 shows the early start and leveled resource histograms using the modified minimum moment algorithm. Figure 5.11 shows the early start and leveled resource histograms obtained by Clough and Sears.  Appendix F consists of reports generated by REPCON for this project. They treat: activity production data, predecessor and successor relationships, resource assignment details, activity dates and float, early start and leveled resource usage profiles, and usage profiles for critical activities. Resource improvement coefficient values for various resource profiles are as follows: RIC - EST Schedule = 1.6842 RIC - Modified Minimum Moment Algorithm = 1.3949 RIC - Clough and Sears solution = 1.7145 Thus we notice that the Clough and Sears solution has worsened the initial RIC. This happened because in that leveled schedule, resource buildup occurred during the central and latter half of the project. During the first 12 days, activities with resources were not scheduled. Thus the increase in the levels of the histogram during the latter half of the project resulted in the increase of histogram moment as measured by RIC.  Chapter 5. Examples 104  BOO^  SUM  29  OM MOM  •  12 -  a 10  S 1.1  8  e  6  •  4  t  2-  n  S  1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69  Project^  •.y•  IN after leveling^El before leveling ^critical resources Figure 5.10 Resource histograms before and after leveling; example 5.10 (Modified Minimum Moment Approach)  12 -  R  6• 10  s. 0 U:.  8  •r c•  6  t  2 -  e  S i iy^';,  0  1^If11111  I^ 1 -  1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69  411 o  after leveling  ^ ^  before leveling^critical resources  Figure 5.11 Resource histograms before and after leveling; example 5.6, (Clough and Sears solution)  Chapter 5. Examples^  107  Example 5.7: Linear Scheduling, Example 1  The network diagram for this example is given in Figure 5.12. This is a linear project with 4 locations involving 3 ordered activities arranged in ascending order of production rate and one resource. The leveling operation for this example was also carried out manually and Figure 5.13 gives the manual computations along with the activity shifting details. Figure 5.14 shows the early start and leveled resource histograms. Linear planning charts for early start, late start and leveled schedules are shown in Figures 5.15, 5.16 and 5.17, respectively. Appendix G gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling.Resource improvement coefficient values for the early start time and leveled resource profiles are as follows: RIC - EST Schedule = 1.1458 RIC - Modified Minimum Moment Algorithm = 1.0937  By arranging the fastest activity first, slowest last in the example, significant float for earlier activities has been created, maximizing opportunities for the shifting of activities at higher locations.  The peaks on days 7 and 8 have been removed in the leveling process and a fairly leveled resource profile has been obtained. As we see in the Linear Planning Chart in Figure 5.17, the flow lines for activity A and activity B have been broken at locations 3 and 4 respectively. Activity C being the critical activity maintains its flow line characteristics. Thus we see that when flow line activities are subjected to leveling operations, they could loose  Chapter 5. Examples ^  their continuous flow line behaviour.  108  early start date^early finish date  location  6 I  A3  4  5  -IP-  B1  3  B B22  ---11.  6  8  A4  7  2  5  activity number  t^t duration^resource rate  7  Sample activity  5  2  10  10  14  14  18  5  B3  8  B4  10  4  12 6  6  12 C2  18  18  9  PP C3  24  24  30  11 rraillim. C 4 6  12  Critical path  Figure 5.12 Network for resource leveling; example 5.7  8  ^  Chapter 5. Examples  ^  110  SSN DAY 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30  1  1 .5 sir  3Z  2  6-5  3  ././' Ar •  •  9-5  4 5  11-5  8 2 3 3  2•5 4•-•5 •  5.5  .0„^...^  ;^  ,^• ....^  ..  .....^ . ^: ^ .^ ............. !^1^ 1^;^ . ^ . ^1 Or Ad 13 51 .^.^  4  : 1245  'ow  .^ .^  .^  .^.  ,  4  10•5  5 ^ ^ICI 5 5 10 10 10 10 15 15 10 10 10!10;1011011011011011015 :5 1515 ; 515151515151 5 51 10 -1.- 6 ^ .5^1-5^1+51+5 i+5^1^1 11^5^5 10 ; 10 : 10110;15;15 ;10 ;10110110110110151515151515 ;10110110110151515151515; 7-0-12^ 11.51.51111^1111^:^1+5J+51^1^111111111 2^5 5 10 10 10110110110110110110110110;10151515 5110!10;10110110110151515151 5151 ^1 CL ..^...^.^.^.^.^.^.^.^. 8 -1.-4^ 1^1^1^1^1-5 1-5^1•5 1+51+51+5 :+51^1^1^1^1^. ^1^1^. ^1 13^5 5 10 10110110 1 101101101101 5 5 5 5110110110110110;1011011011011015 ; 5 15 15 1 55 0 u. 4 -6. 8^:.51•51111111+51+511111111111111111 14^5 5 10;10 : 51 5110110110110 1 51 5 ! 10 1010110110110 10110110110110110 1 5 15 15 15 ^515 5--2^ !^1.51-51^:^1+5451^111:11^1^::^.... 15^5 5 110110 ^5! 5 5! 5;10 ;10 !10!10 10 10 .10 .... 10 10 110;10;1011011011015 5 5 15 ^515 2 -1.- 4^1-51Z;^1+5+5;;!;^11^;^111111^111111 ! 1015 15 5 15 1 515 ^1 6^5 5. 5! 5 5 5110: 10;10110110 1 10110:10110110 :10 10110110:10110;10 , ^ . ^ .^ . .  ^„^ ... 2 -.1- 4 1^+5+51^1.5:.51^ 1^!^11^11^1^111 : .!^:11!^1^!!!:^1^"^11^ 1 7 ! 5^5 10'10 ^5^51 5 ^5:10110 :10110:10; 10;10110; 10110110:10:10110110 :1015 :5 15 :5 :5 15 4^8 !^l+51+51111111.51•5!^11111111^I^11!^111 18 ! 5 i 5 10 j10 1 10110: 51 5110110110110! 5 15 :10110110'10110 10110110 11011015 :5 15 15 15 15 5 -.8- 2^ 1+5 '+5 !^1•5 1 9 :5 5 10 10 :10:101101101101101 5 515 5 10 10110 10 10 10 10;10110:10! 5 ; 5151515 ! 5 7.4- 8^ 1+51+5^ Z 11015 5 10 10!10 10!1011010 10'10 1015 5 10 10110 10I 5 5 ' 10 10110 10 5 5 55 5 +5+5^Z -5 8 .4- 2^ 111 : 5 5 10 10 10 10 10 10 10 10 10 10110 10 10:10 5 5 5 5110 10110 1015 5 5 5 :5 ^5 10 ^4^ +51+5 +5 +5^1-5 Z 112 5 5 10 10 10 10 10 10 10 10 10 10I 10 10 10 10 10 10 10 10 5 5 5 5 5 5 5 5 '5 5  ^.  Figure 5.13 Manual resource leveling computations for example 5.7  16 -  1^2^3^4^5^6^7^8^9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30  pj ,  NI after leveling  ^  ^ before leveling^critical resources  Figure 5.14 Resource histograms before and after leveling; example 5.7  Chapter 5. Examples ^  112  0  # If^IF^1 11f. 0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 duration (days) ,  Figure 5.15 Linear planning chart for early start schedule; example 5.7  Chapter 5. Examples^  0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 duration (days) Figure 5.16 Linear planning chart for late start schedule; example 5.7  113  Chapter 5. Examples ^  3  a 0  To 2  8  0^ [If^I^11[1i^i^f^I^I^I^i^f 0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 duration (days)  Figure 5.17 Linear planning chart for leveled schedule; example 5.7  114  Chapter 5. Examples^  115  Example 5.8: Linear Scheduling Example 2. The network diagram for this example was given in Figure 2.4. This is a linear project with 4 locations involving 1 shadow activity - A (locations 1 to 4), 2 ordered activities - B and C (locations 1 to 4) and 1 continuous activity - D (locations 1 and 2). The leveling operation for this example was also carried out manually and Figure 5.18 gives the manual computations along with the activity shifting details. Figure 5.19 shows the early start and leveled resource histograms. Linear planning charts for early start, late start and leveled schedule are shown in Figures 5.20, 5.21 and 5.22, respectively. Appendix H gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling. Resource improvement coefficient values are as follows: RIC - EST Schedule = 1.2561 RIC - Modified Minimum Moment Algorithm = 1.0134  In this example we see that the shadow activities were associated with large amounts of float. In the early start schedule these activities were scheduled simultaneously causing the peak demand of resources during the first 5 days of the project. In the leveling operation shifting of these activities along with the shift of other activities produced a fairly good leveled resource profile. From the Linear planning chart in Figure 5.22 it can be observed that the continuous flow line behaviour of ordered activity B (early start schedule) is broken at location 3. The shifting behaviour of Shadow activity A requires explanation. We see that the shadow activity A at location 4 has been scheduled before work at location 3. This happened despite the insertion of rule 2 (b) (i) in the modified algorithm. To understand  Chapter 5. Examples^  116  this behaviour, refer to Figure 5.18 which shows the manual leveling computations. During the Forward pass location A 2 (activity 3), A 3 (activity 4) and A4 (activity 5) were tied for a shift of 6 days. The algorithm selected activity 5 (loc.4) for shifting it being the last location of the shadow activity A. In the next trial on this sequence step, activity 5 (loc.4) could not be shifted further (although it had the greatest free float of 12 days) but activity 4 (loc.3) was shifted beyond activity 5 (loc.4). This happened because activity 5 (loc.4) at its new position could not produce an equal or greater improvement factor than activities 4 (loc.3) and 3 (loc.2) and therefore activity 4 (loc.3) was shifted. Again, in the backward pass, activity 4 (loc.3) was not shifted back (owing to the improvement factor produced) but activity 5 (loc.4) was shifted backward by 1 day. Thus, activity 5 (loc 4) was scheduled earlier than activity 4 (loc 3). Expressing it in another way, the initial movement of activity 5 (loc.4) by 6 days hindered its further movement. It can be seen that being greedy and taking the largest shift may not always be the best strategy.  One way to prevent this situation would be to ensure that before shifting a location of a shadow activity, it does not get scheduled beyond its earlier locations (earlier in the sense of execution order). If such a situation arises, then a more logical construction result could be obtained by comparing and switching shadow activity locations while maintaining other precedence relationships. This approach will not generally be workable when the shadow activity has different resource usage rates at different locations.  Chapter 5. Examples  SSN  ^  117  DAYi 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 2-10  2  6 10  3  8-10  4  .1 0-1 0  5  13-10  6  15 - 10  7 3-10^;^1 2  1  410  2  5-10 2  7 ,1 101^,1^  4  !  .10^1!  5 12-10 6  1 1,1 4-1 0  r  6  ^to  10 10 40 40 i40 40 !10 ;40110  20 ^20 120 20 20 20 20 30  SO SO SO 40  20 20 40 110 10 Ito 1,3 Ito tc:1 io !to  :^!^!^:^!^,^r^r^!^! 10 40 r10 -10 10 .10 710 -10 +1010+10+10+10 1+10+10+10 11,14 -41-8i :^r^! 11 40404040 4010 10110110 12020 20 ! 20 120 20120120 20! 20 r 20 !2010 10 !10 i10 4040 i20 20 20120 2020 i^!^:^I^;^I^1^40 40 710 10 ;+10+10+10+10 ^1^1^1^. 12 -■41 12 140 40 40 140 40 10 10 10 i 10 .4020 20 20202012012010 110 10 110 20 20 20 20 2020 120 20 20 202020 10 10^1 10 1+10+11:410+10! 94^ 13 140; 404040' 40110 10110i 1020 2020120110 i10 I10 110 2020120202020 20 201201 20201 20 20 20 20 20 -  :  -  7 ' 2^1^i 10 r40^+10+10 ^!^!^;^"r 14 140! 40: 404040; 10 10! 11:: 100 110 2S! 20: 201 2010 !10 12020 20 . 1 20 20 20 20^.; 20! 20;! 201 20 20 20 20 20 ^ ::;:;.;;;:;;;:., 6 40 -10 -10 10 -10 +1W440410+10410!^ -  -  -  -  ; !^  15 30 30 30 30 30 10 2020 2020 20 20 1:2020 12010 110 :2020 2020 20120 20 2020 20 20 20 20 20 20 20 ^ 4-0-12--10 -10 -10 -10 -10 1 10 1+101+10; 1.+1074-10 + 16 20 20 20 20 20 10 20 2020120 20 20: 3030 3020 20 i20 20 1 1 20202020 2020 2020 20 20 20 20 20 20 3^1 -10^+10 17 10 20 20 20 20 20 20 20 20 20 20 20 30 30 30 20 20  20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20  3^1 + 1 0^-10  8 20 20 20 20 20 10 20 20 20 20 20 20 30 30 30 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 5-■-1^ +10^A0 19 20 20 20 20 20 20 20 20 20 20 10 20 30 30 30 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 +10+10^-10 -10 7 -1- 2^ 1 10 20 20 20 20 20 20 20 20 20 30 20 20 30 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20  Figure 5.18 Manual resource leveling computations for example 5.8  40  R  35 -  S 30 O U 2  r  •  e U  20  —  15  n  i 10  t S  5  1^2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33  P roject a id after leveling^  ^  before leveling^/' critical resources  Figure 5.19 Resource histograms before and after leveling; example 5.8  Chapter 5. Examples^  4  0  8  2  1 1^ I ^ 1^ 1 ^ 1 0 3 6 9 12 15 18 21 24 27 30 33 36 duration (days)  activity A activity B activity C activity D -----*----  Figure 5.20 Linear planning chart for early start schedule; example 5.8  119  Chapter 5. Examples^  0^3^6^9 12 15 18 21 duration (days)  activity A activity B activity C activity D  Figure 5.21 Linear planning chart for leveled schedule; example 5.8  120  Chapter 5. Examples^  121  4  •  3—  C  c.)  I  I I I—F4-1^ 0 3^6 9 12 15 18 21 24 27 duration (days)  1  30 33 36  activity A activity B activity C activity D ♦  Figure 5.22 Linear planning chart for late start schedule; example 5.8  Chapter 5. Examples^  122  Example 5 9- Linear Scheduling Example 3 This is the same project discussed in Example 5.8 but with different resources usages. Two cases have been considered. Case 1: Resource leveling for Resource 1 only and Case 2: Resource leveling for Resource 2 only.  The network diagram, including early start schedule and resource details, is given in Figure 5.23. Appendix I gives the early start and leveled schedule for the project and the daily resource aggregates before and after leveling for the two cases.  Figure 5.24 shows the early start and leveled resource histograms for case 1 - i.e., leveling Resource 1 only. Resource improvement coefficient values are as follows: RIC - EST Schedule = 1.5340 RIC - Modified Minimum Moment Algorithm = 1.0798  Figure 5.25 shows the early start and leveled resource histograms for case 2 - i.e., leveling Resource 2 only. Resource improvement coefficient values are as follows: RIC before leveling = 1.1680 RIC after leveling = 1.0523  early strut date  early finish date  17 21 B 4^12  location  activity number  81 41 6 resources 1^I resources 2  0  5  Al  2  1(1 51 4  0 —a. A2  0 1^5 A3  Stan^1  olol o  14  1(1514  -1 -  ^  8 -1 6  ►  9  13  B  7  2  8141 6  9 3  1C1 5 1 4  0^0  9  C1  15 8  61 618  11•••  13  17  B  9  3  81 41 6 -  17 11.  21  duration  B 4^12  Sample activity  81 41 6  15  21  21  C  10  C  27  27  33  3 13  C 4 15  61 618  61618  61618  17 1 21  21 125  D.  D  2  11 ^  41 4110  33  14  41411(  0101 0  0^5  A4 5 1(1 51 4  33  Ruh 16  Critical path Continuous activity  Figure 5.23 Network for resource leveling with two resources; example 5.9  •  °V1  40  R 35 S 30 U  25  e  20  •  15  MEM  n  i  10  t S  5  1^2 3 4 5 6 7 8 9 10 11  12 13  14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33  Project day it after leveling  ^  Li before leveling ^0 critical resources  Figure 5.24 Resource histograms before and after leveling - Resource 1; example 5.9  25  R 6 20 S 0 U  r  15  C  e  10  n t  1^  2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 !Rat /all  after leveling  ^  ^ before leveling ^critical resources  Figure 5.25 Resource histograms before and after leveling - Resource 2; example 5.9  Chapter 5. Examples^  126  Example 5.10 Large Project - 1 (Linear Scheduling) A larger linear project was subjected to resource leveling. It consisted of 15 locations and 8 activities. Excluding the two milestones and one shadow activity, all the other activities were ordered activities. The logic and schedule along with the activity resource usage profiles can be found in Appendix J. Figure 5.26 shows the leveled resource histogram superimposed over the early start resource histogram. Similarly, Figure 5.27 shows the leveled resource histogram superimposed over late start resource histogram. Figure 5.28, 5.29 and 5.30 show the linear planning charts for the early start, late start and leveled schedules, respectively. It can be observed from the linear planning chart for the leveled schedule that the locations of the shadow activity do not follow the sequence order of the project's locations. Note that the various locations of the shadow activity do not share the same sequence step number.  Resource improvement coefficient values were found to be as follows: RIC - Early Start Schedule = 1.4753 RIC - Modified Minimum Moment Algorithm = 1.2967  The facility to iterate several times (a forward pass and backward pass constitute a single iteration) was added to the computer code. 4 iterations were conducted and a further improvement in the resource histogram was obtained. Figure 4.31 shows the linear planning chart for the leveled schedule after 4 iterations. With 4 iterations, the improvement factor  was:  Chapter 5. Examples^  127  was: RIC - Modified Minimum Moment Algorithm = 1.2707 Left to explore is whether iterations should be conducted on the forward pass and then move to the backward pass including iterations.  90 —  mom  1^6^11^16^21^26^31^36^41^46^51^56  61^66^71^76^81^86^91^96 101 106 111 116 121  =MEM after leveling^^ before leveling  Figure 5.26 Resource histogram: leveled and early start; example 5.10  80 —  1^6^11^16^21^26^31^36^41^46^51^56^61^66^71^76^81^86^91^98 101 106 111 116 121 1010  ^llllE^after leveling^^ late start profile  Figure 5.27 Resource histograms: leveled and late start; example 5.10  UBC CONSTRUCTION MANAGEMENT LAB  REPCONTM TEST PROJECT FOR THESIS — EXTENDED TEST 1 Page 2W 2  Early Dates  File Used 0 \REP200\PROJ23\ASHONE  Report Date:^27APR93 Report Time:^15:24:41 Progress Date: Revision Number: 0  .  LINEAR PLANNING CHART ACTIVITY INDEX^ Select All Activities Sort:^Activity Code Date Selection Act/Sch/Early Schedule Window Time OINAR93 To 29JUN93 Locations:^I To^15 .  .  FEY^* Critical^Activity  p^Activity has procurement sequence^c^Completed  Code Type Description G00700 SM PROJECT START  Activity Types: 0 Ordered, C Continuous. S Shadow, H Hammock, SM Start Milestone, FM Finish Milestone  Code^Type Description G00300^0^ACTIVITY  * ® G00100  0 ACTIVITY A  * OG00400^0^ACTIVITY 0  * 0 G00200  0 ACTIVITY B  0600500^D^ACTIVITY E  Code Type Description 0 G00600 0 ACTIVITY F  O  Q  VI  "P.  G00800 S ACTIVITY G  1993  LOCN 8  MARCH 15  22  . 15  29  5  ..  .  APRIL 12^19  26  3  10  .  MAY 17 .  24  7  JUNE 14  . ,7  21  .  .  .  .  28  .  14 13  .  .  .^.  .  .  .  12 11  .  7  .  10 9  .  .  .  8 7  .  .  •  6  //—  5  .  4 3  .  .  .  .  .  .  2 1  1 2  • 3  411 8  •  5 15 MARCH  22  29  5  t  .  12^0 APRIL  M  .  •  3  10  .  17 MAY  •  24  14  7  JUNE  1993  Figure 5.28 Linear planning chart for early start schedule; example 5.10  21  28  Loa O  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCONIM  TEST PROJECT FOR THESIS - EXTENDED TEST 1  Page 2 01 2  Late Oates LINEAR PLANNING CHART ACTIVITY INDEX  File Used 0 \REP200\PROJ23\ASHONE  Report Date:^27APR93 Report Time:^15:22:35 Progress Date: Revision Number: 0  Select' All Activities Sort^Activity Code Date Selection: Act/Sch/Late Schedule Window ^To 29JUN93 lime. Locations'^I To^15  * Critical Activity^p Activity has procurement sequence ^c Completed^Activity Types: 0 Ordered, C Continuous, S Shadow. H Hammock, SN Start Milestone, FM Finish Milestone  O  Code Type Description O G00700 SW PROJECT START 0  Code Type Description G00300 0 ACTIVITY C  Code Type Description 0 G00600 0 ACTIVITY F  0600100^0 ACTIVITY A  G00400^0 ACTIVITY 0  ® G00800 S ACTIVITY G  G00200 0 ACTIVITY I  @ G00500 0 ACTIVITY E  0  LOCN  MARCH 8^15  1993  APRIL 22  29  5  12^19  26  MAY.  3  10^  JUNE  17^24  7^14  .^.^.  15 14 13 12 11 10  •  9  28 -./  / ^ —I/ .  . .  0. . . .....7,  21  .  Z/ 7  .  .^ . .  .  .  .Z  .  ^  /7 `/ Z /  /.  7  6 5  /7  /  ./7 /7 //  .  3 2  1  K  &5 8^15 MARCH  .  . 22  29  5  .  12^19  APRIL  26  3  1993  .^ . ^. 10^17^24  MAY  . 7^14  Figure 5.29 Linear planning chart for late start schedule; example 5.10  JUNE  N  / 28  UBC CONSTRUCTION MANAGEMENT LAB ^  REFICON"  TEST PROJECT FOR THESIS — EXTENDED TEST 1  Page 2 Of 2  Resource Leveled Dates  File Used D. \REP200\PROJ23\ASHONE  Report Date:^27APR93 Report Time:^15:28:09 Progress Date: Revision Number: 0  LINEAR PLANNING CHART ACTIVITY INDEX Select All Activities Sort ^Activity Code Date Selection' Act/Sch/Res Lev Schedule Window Time: 0IMAR93 To 29JUN93 Locations:^1 To^15 .  .  KEY^x Critical Activity^p Activity has procurement sequence  c Completed^Activity Types: 0 Ordered. C Continuous, S Shadow, H Hammock, SW Start Milestone, FM Finish Milestone  Code Type Description G00700 SM PROJECT START  Code Type Description G00300^0 ACTIVITY C  ® G00100 0 ACTIVITY A  x 0600400 0 ACTIVITY 0  w0 G00200 0 ACTIVITY B  0 G00500 0 ACTIVITY E  Code Type Description 0 G00600 0 ACTIVITY F x 0 G00800 S ACTIVITY G  1993 LOCN  MARCH 8^15  22  29  5  APRIL 12^19  3  10  MAY 17  24  14  7  <i  .  15  13  26  7  •  JUNE 14^21  12  —7/ _Z '  Z -.  .  28  ___/: , ../  10 .  6  4  2  /.  .  /  8  •  _  .  /  Z /  , •  .  .  .  .  .^.  29  5  12^19 APRIL  •  . i  .  .  2^3^  8^15 MARCH  .  22  26  3  10  17 MAY  24  (P...<. 7  14^21 JUNE  1993  Figure 5.30 Linear planning chart for resource leveled schedule; example 5.10  28  UBC CONSTRUCTION MANAGEMENT LAB TEST PROJECT FOR THESIS — EXTENDED TEST 1 Resource Leveled Dates LINEAR PLANNING CHART ACTIVITY INDEX  File Used 0 \REP200\PHOJ23\AS110NE  Report Date:^28APR93 Report Time:^16: 33: 15 Progress Date: Revision Number: 0  Select All Activities .  Sort^Activity Code Date Selection Act/Sch/Res Lev Schedule Window Time 0INAR93 Io 29JUN93 Locations'^110^15  AT Y^v Critical Activity ^p Activity has procurement sequence ^c Completed^Activity Types: 0 Ordered, C Continuous, S Shadow, H Hassock, SN Start Milestone. FN Finish Milestone Code Type Description 600700 SW PROJECT START  Code Type Description A O 600300 0 ACTIVITY C  Code Type Description 0 G00600 0 ACTIVITY F  m O600100 0 ACTIVITY A  o O600100 0 ACTIVITY 0  w8O600800 S ACTIVITY G  m 0 G00200 0 ACTIVITY B  0 600500 0 ACTIVITY E  MARCH  LOCN  15  8  22  29  APRIL 12^19^26  5  1993 3  10  MAY 17  24  .  15  JUNE  7  14^21  28  .  14  13 12  .  .  —  ___,/r  7_^ X 7  11  //  _Z  10 9 a  .^.  •  . _ .7  Z  .  .  7  .  6  5  /—  .  2  .^.  •  i  . 7  1  2  3  I  e  •  5  15  MARCH  22  29  . 5  12^19^26  APRIL  . 3  1993  M  0 17  MAY  .^.  •  N  7  (t( IA^a  JUNE  Figure 5.31 Linear planning chart for resource leveled schedule; example 5.10 (after four Iterations)  M  Chapter 5. Examples^  134  Example 5.11 Large Project - 2 (Linear Scheduling)  The logic and schedule for this example project can be found in appendix K along with activity resource details. Figure 5.32 shows the resource leveled histogram superimposed over the early start histogram. Similarly, Figure 5.33 shows the resource leveled resource histogram superimposed over late start resource histogram. Figures 5.34, 5.35 and 5.36 show the linear planning charts for the early start, late start and leveled schedules, respectively.  Resource improvement coefficient values were found to be as follows: RIC - EST Schedule = 1.3794 RIC - Modified Minimum Moment Algorithm = 1.2510  The presence of flow lines restricted the movement of the activities by limiting the amount of floats. The effects of flow lines were more prominent during the initial phase of the project where the activities were either critical or near-critical. For this project, most noncritical activities with considerable floats were scheduled during the latter part of the project. Therefore, significant changes and smoothing in the resource profile can be seen in this part of the schedule.  This is the largest project for which the leveling operation was carried out and is much larger than any example found in the literature. The results demonstrate that the Modified Minimum Algorithm is workable for large sized projects.  Chapter 5. Examples^  135  This example was solved on an IBM 286 machine using a file server and the computation time was found to be approximately 3 minutes. With the availability of 386, 486 and now even 586 machines, the computation time can be significantly reduced.  1^11^21^31^41^51^61^71^81^91^101^111^121^131^141^151^161^171^181^191^201 Project day after leveling^^ before leveling Figure 5.32 Resource histograms: leveled and early start; example 5.11  1^11^21^31^41^51^61^71^81^91^101^111^121^131^141^151^161^171^181^191^201 Project day I after leveling^^ late start profile Figure 5.33 Resource histograms: leveled and late start; example 5.11  ^  UGC CONSTRUCTION MANAGEMENT LAB ^  REPCONTN  SAMPLE HIGHRISE PROJECT — REVISED SCHEDULE VER 2.0  Page 1 Of 2  Early Start Time Dates  File Used D \REP200\PADJ11\SANPLE  Report Date:^27APR93 Report Time:^14:48'49 Progress Date: Revision Number: 0  Select All Activities Sort ^Start Date Date Selection: Act/Sch/Early Schedule Window Time: 01JUN88 To 31NAR89 Locations GPRJ To PNTH .  .  .  1988 JULY^I AUGUST SEP^I OCTOBER 6^13^20^27^4 11^18^25^2 8^15^22^29 6^12^19^26^3 11^17^24  LOCN  JUNE^I  PNTH  . ^.  ROOF  9 a  7 6 5 4 2  .  ..  . .^.^.  ,,,  riA  10  3  _^.  1989 NOV DEC JANUARY FEB MARCH 7^14^21^28 5^12^19^28 9^16^23^30 6^13^20^27 6^13^20^28  ■  15,1 II  ,,ger  :#1111111110.141WAIAMIIIIIIIMII Wil NEFAIIIPAINIIIMMIKEWM MEIN EINIEWAMIIIMIIIIIIIIIMPOIMIN .1/1111111/11/11211OVAIRIMIWANWMAIIIII 111111/111111111011111111/AWASIVAIIIKMAIM111111 INCIIIIIIIITANIAMMIANEMENVAMME VEMIIIIIMPRAFAVAIRIMIWAMIIIIIIIIIIIIII Ail grArANWMPAMINWATIWAIIIIVAMMIMI 11111111M11111111MVAIVAMMINFAMINIIIIMINIEll MM. 11116111"311EMB21.1■11.1111111-W 1 ,,itkiprigrig rd11111111111111111112111111111M  MAIN ■ NEM ainalIM BI 82 1111WAMAD21111111.11=111111.111110 I EMII lif4a 1 I I II • II ICD I r(D( ) FON MIMI SW WWII I it EglaKM ^II brIMMIIIIIMINVAPPI OS Gina . . . ^. ^ . .^ . APPR ^.... . 111111MMI '^ 1 GPRJ ir  ■  11  61320274111825 2^8^15^22^29 6^12^19^26 3^11^17^24 JUNE^JULY^AUGUST SEP^'OCTOBER 1988  7^14^2!^28 5^12^19^28 9^16^23^30 NOV DEC JANUARY  Figure 5.34 Linear planning chart for early start schedule; example 5.11  6^13^20^27  FEB 1989  6^13^20^28  MARCH  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCON"  SAMPLE HIGHRISE PROJECT — REVISED SCHEDULE VER 2.0  Page I Of 2  Late Start Time Dates  File Used D \REP200\PROJTOSANPLE  Report Date:^27APR93 Report Time:^14:53:45 Progress Date: Revision Number: 0  Select . All Activities Sort'^Start Date Date Selection . Act/Sch/Late Schedule Window Time 01JUN88 To 31NAR89 Locations . GPRJ To PNTH  1988  LOCN JUNE^1 JULY^I AUGUST ^SEP^ I  6^0^RP 4  PNTH  UN^25^2  8^15^22^29  _  ROOF 10 9 B  1989  DEC  9^than  5^Qoa  767 /4I  .  JANUARY  FEB  6^nav  MARCH  6^nan  A  VIII.11 — -- ----I-1 — EMI WA rall I Pia IIMV P'^All  IIIIMIMIWA WE IIIIIMEIM El  V, 4i  AWPAPIMMIll WAND' AUNIARMAIIKI  INFAWAVIEMPWATIERMIll  mid IIIMPAVAMIEWAIMEM ElltiiiMMIVAIIIIIMPAMPAVAIF F AIME.  s  5  /1111.111111111VAII/ AWAIWAII/1111 111111MOIMYANNIAIWAIMIRME MOWN EMU AMPANYAIONIEMPIEMEI  4  4;q  3  ■I11111111111M1111111111111111•11111=61111MENIENIAININA mmo ettAmill n.yr Aitimmalawm. BRIMPWFAIMI  IPJLIKAIIVIMIIIIII sw IINIAVAMININ CIM DS ■ 111103111111118111 APPR GPRJ  NOV 7^M^'a^28  .  7  2 MAIN B1 B2 EON  6^12^6^26^3  OCTOBER HPN  ■NM. # 0  ..-11W111111111111111/AMal  €111111XUD (111LNINCIIIMIIIIIIINLI Imormismimi IA MialaMEMENEW 1  ^,  6132027 4111825 2^8^l5 22 JUNE^JULY^AUGUST  3111724 SEP^!OCTOBER 1988  7142128 NOV  512628 DEC  9 wsomvsnan JANUARY FEB MARCH 1989  Figure 5.35 Linear planning chart for late start schedule; example 5.11  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCONIN  SAMPLE HIGHRISE PROJECT — REVISED SCHEDULE VER 2.0  Page I Of 2  Resource Leveling Time Dates  File Used A: \SAMPLE  Report Date:^29APR93 Report Time:^15:57:54 Progress Date. Revision Number: 0  Select All Activities Sort'^Start Date Date Selection: Act/Sch/Res Lev Schedule Window Time 01JUN88 To 31MAR89 Locations GPRJ To PNTH .  .  LOCN  JUNE^I 6^13^20^27^4  PNTH. ROOF  JULY^I ll^18^25^2  AUGUST 8^15^22^29  .  1988 1 OCTOBER SEP 6^12^19 26^3 II^17^24  Al441  9 B  6 4  3  SW  0S  MARCH 6^13^20^28  .  I^1  OrdrAllarrainialliralirAINO•11111  I  ritaimmoVAIWIAVAIIPIAWANS4/1111111111111111111111111111 OD to."11111111111/APAIIIIRMINEMMILMS■111111111111EVEIV ,d44111111 si =KIM '41446. ggr AMINIMIEWAININWA 4"Álit#11AP Ali1 Pr MIMI IMINFAI • :TO (M111111111MENIIIIIINIESIMIENUI D 11 PPP'^ ..■•••" ;laIII IIIIENT 19: V WON  -  . .^ _  0 NO  APPR GPRJ  1989 FEBRUARY 6^13^20^27  111111111111111111111,01111111APAPIEMIIIIREWANIAMINI IffirifilliffrAirAMINFAMMEMIEMOMWAIMMII Mil WAWMAINFAIIIIWANO2111111/41111111111111  5  B2  1,  JANUARY 9^16^23^30  1111111/11MNIFAIREMIIIIIIIIIMIW111111  7  FDN  DECEMBER 5^12^19^28  A .--.-^ _. --MIIILIIMIIIIFAFACSWAOIAWSIIMIIIMPYAIIIH WAVAIIIIIIIIIIIMINWAVAIII lin will 111111111111111FAMINIVATONWAIIII  .^.  to  2 MAIN B1  NOVEMBER 7^14^21^28  . 6020274 JUNE  . II^18^25  JULY  . 2^8^15^22296  AUGUST  12^19 26 SEP 1988  cio  .^.^.  3^111724 OCTOBER  ®^la  e)  . 71421285121928 NOVEMBER DECEMBER  .1 9^16^23^30  JANUARY  6^13^20^27  FEBRUARY 1989  Figure 5.36 Linear planning chart for resource leveled schedule; example 5.11  6^13^20^28  MARCH  7  Chapter 6  ^  141  CONCLUSION AND RECOMMENDATIONS  The objective of this thesis, which was to explore resource leveling as it applies to linear scheduling and variable resource usage at the activity level, has been accomplished. The Minimum Moment Algorithm by Harris (22) has been modified to include additional rules for the purpose of resource leveling of linear schedules. The modified algorithm was developed based on REPCON's special modeling structures which facilitate linear scheduling. It was then programmed and implemented into REPCON. Further modifications have been made in the basic algorithm to make it more computationally time efficient.  The Modified Moment Algorithm has been tested on a series of examples and the results have been presented in the previous chapter. The results obtained through the use of this procedure in most cases are found to be better than the results obtained from other leveling procedures.  For the multiple resource case, the algorithm currently combines the resources assuming a natural weighting and levels them in a single operation. With the assumption of natural weighting, the resource which contributes the most to the "difference of the daily resource aggregates" is favored in the leveling operation. In future, this work should be extended to derive weights to allow, for example, resources to contribute equally to the leveling process. The computation of weighting factors for respective resources can be based upon the criteria  Chapter 6. Conclusion and Recommendations ^  142  of "difference of daily resource aggregates" over the project duration, as described in Harris (22). Another approach would be to allow the user to assign weights directly. This facility has been incorporated in REPCON.  In future, alternate priority rules should be explored for step 2(b) of the algorithm, where, in order to select an activity for shifting, a choice must be made among identical improvement factors. Instead of the rule which states that one should select the activity with the greatest free float, an alternate might be "to select the activity with the greatest amount of shift". For the variable resource usage case, the rule "select the activity with the greatest total resource consumption" may be replaced with the rule "select the activity with the greatest average resource rate ( = total resource consumption/duration)". These rules should be tried out over a variety of examples and a comparative analysis should be made to ascertain the performance of these heuristic rules.  The effect of multiple iterations of the forward and backward pass on the leveling results should be further explored. The testing should be done on large-sized projects involving activities with significant amounts of float. In the present implementation, this facility has been included by giving the user the option to decide on the number of iterations to be performed. One iteration signifies a forward pass followed by a backward pass. Another approach which should be explored is to first conduct the forward pass iterations followed by the backward pass iterations.  Chapter 6. Conclusion and Recommendations ^  143  Further investigations should be carried out to test the effectiveness of the algorithm using total float as the maximum limit of the shift for any activity rather than using the criteria of free float. The algorithm may further be extended to include the condition of activity splitting.  Another interesting approach would be to fuse the Minimum Moment Algorithm with the Packing Method for Resource Leveling. While making the decision to shift an activity on any sequence step, the penalties contributed by the preceding activities in the forward pass and the succeeding activities in the backward pass may also be ascertained apart from calculating the moments of the resource histogram. The resultant effect of the moment of the histogram and the penalties contributed by the preceding or succeeding activities due to the shift will determine the activity's positioning. This procedure likely would turn out to be computationally time intensive compared to the Minimum Moment Algorithm by itself.  Lastly, the modified minimum moment algorithm could be extended to the resource allocation case, where the minimum project duration extension is sought in order to have the peak of the resource histogram be less than or equal to some user imposed limit  0+ BIBLIOGRAPHY  (1)  Adrian, J., "Quantitative Methods in Construction Management," American elsvier Publishing Company, Inc., New York, 1973.  (2)  Ahuja, H.N., "Project Management, Techniques in Planning and Controlling Construction Projects," John Wiley & Sons, New York, 1984.  (3)  Antill, J.M. ,and Woodhead, R.D., "Critical Path Methods in Construction Practice," John Wiley & Sons, Inc., New York, 1982.  (4)  Archibald, R.D., and Villoria, R.L., "Network-Based Management Systems (PERT/CPM)" John Wiley & Sons, Inc., New York, 1965.  (5)  Arditi, D., and Albulak, Z., "Line-Of-Balance Scheduling in Pavement Construction," Journal of Construction Engineering and Management, ASCE, Vol. 112, No. 3, September, 1986.  (6)  Badiru, A.B., "Project Management in Manufacturing and High Technology Operations," John Wiley & Sons, Inc., 1988.  (7)  Battersby, A., "Network Analysis for Planning and Scheduling," Macmillan and Company Limited, London, 1967.  (8)  Boctor, F.F., "Some Efficient Multi-Heuristic Procedures for Resource-Constrained Project Scheduling," European Journal of Operational Research, November 6, 1990.  (9)  Burgess, A.R., and Killebrew, J.B., "Variation in Activity Level on a Cyclic Arrow Diagram," Journal of Industrial Engineering, March-April, 1962.  (10)  Burman, P.J.,"Precedence Networks for Project Planning and Control, "McGraw-Hill Book Company (UK) Limited, London, 1972.  (11)  Busch, D.H., "The New Critical Path Method, The State-of-Art in Project Modeling and Time Reserve Management," Probus Publishing Company, Chicago, Illinois, 1991.  (12)  Carmichael, D.G., "Construction Engineering Networks: Techniques Planning and Management," Ellis Harwood Limited, Chichester, 1989.  Bibliography^  145  (13)  Carr, R.I., and Meyer, W.L., "Planning Construction of Repetitive Building Units," Journal of the Construction Division, ASCE, Vol.100, No.0O3, September., 1974.  (14)  Charzanowski, E.N.,and Johnston, D.W.," Application of Linear Scheduling," Journal of Construction Engineering and Management, ASCE, Vol.112, 1986.  (15)  Clough, R.H., and Sears, G.A., "Linear Scheduling Method for Highway Construction," Second Ed., John Wiley and Sons, New York, 1979.  (16)  Davis, E.W., "Project Scheduling Under Resource Constraints: Historical Review and Categorization of Procedures," AIIE Transactions, December 1973.  (17)  Dewitte, L., "Manpower Leveling of PERT Networks," Data Processing for Science/Engineering, March-April, 1964.  (18)  Easa, S.M., "Resource Leveling in Construction by Optimization," Journal of Construction Engineering and Management, ASCE, Vol.115, No.2, June, 1989.  (19)  Elmaghraby, S.E., "Activity Networks," John Wiley & Sons, New York, 1977.  (20)  Fondahl, J.W., "A Noncomputer Approach to the Critical Path Method for the Construction Industry," Dept. of Civil Engineering, Stanford University, Stanford, Calif., 2nd Edition, 1962.  (21)  Galbreath, R.V., "Computer Program for Leveling Resource Usage," Journal of Construction Division, ASCE, Vol.91, No.1, 1965.  (22)  Harris, R.B., "Precedence and Arrow Networking Techniques for Construction," John Wiley & Sons, New York, 1978.  (23)  Harris, R.B., "Packing Method for Resource Leveling (PACK)," Journal of Construction Engineering and Management, ASCE, Vol.116, No.2, June 1990.  (24)  Hendrickson C., and Au, T., "Project Management for Construction," Printece Hall, Inc. Englewoods Cliffs, New Jersey 07632, 1989.  (25)  Johnston, D.W., "Linear Scheduling Method for Highway Construction," Journal of Construction Division, ASCE, Vol.107, No.0O2, June 1976.  (26)  Kasevich, L.S., "Harward Project Manager/Total Project Manager: Contolling Your Resources," Tab Books Inc., Blue Ridge Summit, PA 17214, 1986.  Bibliography^  146  (27)  Kelley, J., "Critical Path Planning and Scheduling: Mathematical Basis," Operation Research, Vol.9, No.3, May-June 1961.  (28)  Kochan, S.G., "Programming in ANSI C," Hayden Books, Indianapolis, Indiana, 1988.  (29)  Lewis, J.P., "Project Planning, Scheduling & Control," Probus Publishing Company, Chicago, Illinois, 1991.  (30)  Lockyer, K., "Critical Path Analysis and Other Project Network Techniques," Pitman Publishing Limited, London, 1984.  (31)  Martino, R.L., "Resource Management," MDI Publications, Management Development Institute, Inc., Wayne, Pennsylvania, 1968.  (32)  Moder, J.J., Phillips, C.R., and Davis, E.D., "Project Management with CPM, PERT and Precedence Diagramming," Van Mostrand Reinhold, New York, 1983.  (33)  O'Brien, J.J., "Scheduling Handbook," McGraw-Hill Book Company, New York, 1969.  (34)  O'Brien, J.J., "VPM Scheduling for High Rise Buildings," Journal of the Construction Engineering Division, ASCE, Vol.101, No.004, December 1975.  (35)  O'Brien, J.J., Kreitzberg, F.C.,and Mikes, W.F.,"Network Scheduling Variations for Repetitive Work," Journal of the Construction Engineering and Management, ASCE, Vol.111, No.2, June 1985.  (36)  Oldrich, S., and Cacha, J., "Time Space Scheduling Method," Journal of the Construction Division, ASCE, Vol.108, No.0O3, September 1982.  (37)  Peters, G., "Construction Project Management Using Small Computers," The Architectural Press: London, 1984.  (38)  Purdum, J., "QuickC Programming," SAMS, Carmel, IN 46032, 1990.  (39)  Russell, Alan, D., "REPCON: An Innovative Construction Management System", Managing Projects, by V. Ireland and T. Uher (eds.), International Symposium on Building Economics and Construction Management, Sydney Australia, Vol.6, 1990.  (40)  Russell, A. D., and Wong, W.C.M., "A new Generation Of Planning Structures, "ASCE Journal of Construction Engineering and Management, June 1993.  Bibliography^  147  (41)  Sarraj, Z.M., "Formal Development of Line-Of-Balance Technique," Journal of Construction Engineering and Management, ASCE, Vol.116, No.4, 1990.  (42)  Seibert, J.E. , and Evans, G.W., "Time-Constrained Resource Leveling," Journal of Construction Engineering and Management, September, 1991.  (43)  Stevens, J.D., "Techniques for Construction Network Scheduling," McGraw-Hill Publishing Company, New York, 1990.  (44)  Thesen, A., "Computer Methods in Operation Research," Academic Press, Inc., New York, 1978.  (45)  Wiest, J.D., and Levy, F.K., "A Management Guide to PERT/CPM with GERT/PDM/DCPM and other Networks," Prentice-Hall, Inc.,Englewood Cliffs, New Jersey, 1977.  (46)  Wilson, R.C., "Assembly Line Balancing and Resource Leveling," University of Michigan Summer Conference, Production and Inventory Control, 1964.  148  Appendix - A  149  Activity  Leveled Schedule  FF  EFD  ESD  Resources  Duration  Start Date  Finish Date  1  0  0  0  0  0  0  0  2  2  3  0  2  0  2  4  3  2  6  0  2  0  0  2  4  1  4  0  1  0  0  1  5  4  0  2  6  0  4  8  6  5  0  2  7  0  2  7  7  8  4  2  10  0  2  10  8  3  5  1  4  6  4  7  9  1  4  6  7  4  11  12  10  4  2  7  11  0  7  11  11  5  2  10  15  0  10  15  12  3  0  11  14  1  12  15  13  0  0  15  15  0  15  15  Early Start and Leveled Schedule - example 5.1  Project day  1  2  3  4  5  6  7  8  Resource aggregates before leveling  13  14  9  9  4  4  8  6  Resource aggregates after leveling  10  6  7  7  9  9  9  6  Project day  9  10  11  12  13  14  15  Resource aggregates before leveling  6  6  4  2  2  2  2  Resource aggregates after leveling  6  6  4  6  2  2  2  Daily Resource Aggregates before and after leveling - example 5.1  150  Appendix - B  151  Activity  ESD  Resources  Duration  EFD  FF  Leveled Schedule Start Date  Finish Date  1  0  0  0  0  0  0  0  2  2  2  0  2  0  0  2  3  4  1  0  4  0  0  4  4  1  4  0  1  0  0  1  5  4  4  2  6  1  10  14  6  3  2  4  7  0  7  10  7  6  4  4  10  0  4  10  8  6  6  1  7  0  1  7  9  1  0  7  8  7  14  15  10  4  2  7  11  4  11  15  11  5  1  10  15  0  10  15  12  1  2  15  16  0  15  16  Early and Leveled Schedule - example 5.2  Project day  1  2  3  4  5  6  7  8  Resource aggregates before leveling  7  9  11  11  16  16  12  6  Resource aggregates after leveling  7  9  7  7  10  10  10  6  Project day  9  10  11  12  13  14  15  16  Resource aggregates before leveling  6  6  3  1  1  1  1  2  Resource aggregates after leveling  6  6  5  7  7  7  3  2  Daily Resource Aggregates before and after leveling - example 5.2  152  Appendix - C  153  Activity  Duration  Resources  EFD  ESD  Leveled Schedule  FF  Start Date  Finish Date  1  0  0  0  0  0  0  0  2  '2  10  0  2  0  0  2  3  1  2  0  1  2  2  3  4  1  4  2  3  0  3  4  5  3  6  2  5  0  2  5  6  1  2  3  4  1  4  5  7  0  0  5  5  0  5  5  Early Start and Leveled Schedule - example 5.3  Project day  1  2  3  4  5  Resource aggregates before leveling  14  10  8  8  6  Resource aggregates after leveling  10  10  8  10  8  Daily Resource Aggregates before and after leveling - example 5.3  154  Appendix - D  155  Activity  Resources  Duration  ESD  Leveled Schedule  FF  EFD  Start Date  Finish Date  1  0  0  0  0  0  0  0  2  8  11  0  8  0  0  8  3  4  5  0  4  0  0  4  4  5  8  0  5  0  3  8  5  9  16  8  17  1  8  17  6  14  5  4  18  7  11  25  7  6  3  4  10  2  5  11  8  7  7  5  12  0  15  22  9  8  8  17  25  0  17  25  10  3  7  12  15  0  22  25  11  0  0  25  25  10  25  25  Early and Leveled Schedule - example 5.4  1  2  3  4  5  6  7  8  9  Resource aggregates before leveling  24  24  24  24  27  26  26  26  31  Resource aggregates after leveling  16  16  16  24  19  22  22  22  19  Project day  10  11  12  13  14  15  16  17  18  Resource aggregates before leveling  31  28  28  28  28  28  21  21  13  Resource aggregates after leveling  19  19  21  21  21  21  28  28  20  Project day  19  20  21  22  23  24  25  Resource aggregates before leveling  8  8  8  8  8  8  8  Resource aggregates after leveling  20  20  20  20  20  20  20  Project day  Daily Resource Aggregates before and after leveling - example 5.4  156  Appendix - E  157  Activity  ESD  Resource 1  Duration  FF  EFD  Leveled Schedule Start Date  Finish Date  1  0  0  0  2  0  0  0  2  2  0  0  2  0  0  2  3  .^5  2  0  5  0  0  5  4  3  2  0  3  0  0  3  5  2  1  2  4  4  3  5  6  6  2  2  8  0  2  8  7  6  3  5  11  0  5  11  8  6  1  3  9  0  5  11  9  4  0  3  7  2  3  7  10  2  4  8  10  8  14  16  11  7  2  11  18  0  11  18  12  3  2  9  12  6  11  14  13  2  4  9  11  7  16  18  14  2  0  18  20  0  18  20  Early and Leveled Schedule: Resource 1 - example 5.5  Project day  1  2  3  4  5  6  7  8  9  10  Resource aggregates before leveling  4  4  7  6  5  6  6  6  8  13  Resource aggregates after leveling  4  4  6  5  5  6  6  6  4  4  Project day  11  12  13  14  15  16  17  18  19  20  Resource aggregates before leveling  9  4  2  2  2  2  2  2  0  0  Resource aggregates after leveling  4  4  4  4  6  6  6  6  0  0  Daily Resource Aggregates before and after leveling: Resource 1 - example 5.5  158  Activity  Resource 2  Duration  ESD  EFD  Leveled Schedule  FF  Start Date  Finish Date  1  0  0  0  2  0  0  0  2  2  2  0  2  0  0  2  3  '^5  3  0  5  0  0  5  4  3  0  0  3  0  0  3  5  2  4  2  4  4  11  13  6  6  5  2  8  0  2  8  7  6  2  5  11  0  5  11  8  6  0  3  9  0  3  9  9  4  5  3  7  2  7  11  10  2  5  8  10  8  13  15  11  7  0  11  18  0  11  18  12  3  8  9  12  6  15  18  13  2  3  9  11  7  11  13  14  2  0  18  20  0  18  20  Early and Leveled Schedule: Resource 2 - example 5.5  Project day  1  2  3  4  5  6  7  8  9  10  Resource aggregates before leveling  5  5  12  17  13  12  12  7  7  18  Resource aggregates after leveling  5  5  8  8  8  7  7  12  7  7  Project day  11  12  13  14  15  16  17  18  19  20  Resource aggregates before leveling  13  8  0  0  0  0  0  0  0  0  Resource aggregates after leveling  7  7  7  5  5  8  8  8  0  0  Daily Resource Aggregates before and after leveling: Resource 2 - example 5.5  159  Activity  Duration  Resource 1 + Resource 2  ESD  EFD  Leveled Schedule  FF  Start Date  Finish Date  1  0  0  0  2  0  0  0  2  2  2  0  2  0  0  2  3  '^5  5  0  5  0  0  5  4  3  2  0  3  0  0  3  5  2  5  2  4  4  2  4  6  6  7  2  8  0  5  11  7  6  5  5  11  0  5  11  8  6  1  3  9  0  4  10  9  4  5  3  7  2  3  7  10  2  9  8  10  8  13  15  11  7  2  11  18  0  11  18  12  3  10  9  12  6  15  18  13  2  7  9  11  7  11  13  14  2  0  18  20  0  18  20  Early and Leveled Schedule: Resource 1 + Resource 2 - example 5.5  Project day  1  2  3  4  5  6  7  8  9  10  Resource aggregates before leveling  9  9  19  23  18  18  18  13  15  31  Resource aggregates after leveling  9  9  12  15  11  18  18  13  13  13  Project day  11  12  13  14  15  16  17  18  19  20  Resource aggregates before leveling  22  12  2  2  2  2  2  2  0  0  Resource aggregates after leveling  12  9  9  11  11  12  12  12  0  0  Daily Resource Aggregates before and after leveling: Resource 1 + Resource 2 - example 5.5  160  Appendix - F  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON TM  Example Project from Clough and Sears  ^  Page 1 Of 3  pred/suec/duration File Used: C:\REP280\PROJ06\CLOUGH Select: All Activities Sort:^Activity Code  ACTIVITY CODE^DESCRIPTION  Report Date:^19APR93 Report Time:^14:26:38 Revision Number: 0 Progress Date:  * Critical Activity + Governing predecessor of an activity or successor governed by activity  PREDECESSORS ACT. CODE^DESCRIPTION  SUCCESSORS TYPE PLOC DEL LAG^OFF/LOC I ACT. CODE^DESCRIPTION  *G88100  Project Start  *G00208  Shop drawings abut&steel deck *+MMM  Project Start  T  FS^0  G00388  Shop dwgs footing steel  *40M80  Project Start  T  G88400  Move in  *400100  Project Start  680500  Deliver piles  *400100  M0688  Shop drawings girders  *+G80100  MNM  Deliver footing steel  +G00388  G80808  Make abutment forms  600980  TYPE SLOC REL LAG^OFF/LOC  LOC_RANGEI PROD. DATA WORK SKIP DUBI  +C00608 +G80500 +G80400 +G88380 *+C00280  Shop drawings girders Deliver piles Move in Shop dwgs footing steel Shop drawings abut&steel deck  T T T T T  FS FS FS FS FS  N  1-  1 1  0  0  0^N  *+601200  Deliver abutment & steel deck  T  FS  N  1-  1 1  0  10  FS^0  0^N  +C00700  Deliver footing steel  T  FS  N  1-  1 1  0  5  T  FS^0  0^N  +G88900 G00800  Excavate abutment 4 1 Make abutment forms  T T  FS FS  N  1-  1 1  0  3  Project Start  T  FS^8  0^11  +G81808  Drive piles abutment Al  1  FS  N  1-  1 1  8  15  Project Start  T  FS^0  0^N  +G02700  Deliver girders  FS  N  1-  1 1  0  10  Shop dwgs footing steel  T  FS^8  ON  G81300  G00400  Move in  T  FS^0  0^N  * G81700  Excavate abutment 4 1  +G08480  Move in  T  FS^8  ON  G01100 G01000  G01808  Drive piles abutment 41  G08980 +G00508  Excavate abutment 0 1 Deliver piles  T T  FS^8 FS^0  0^N 0^N  G81100  Excavate abutment AZ  G80988  Excavate abutment 4 1  T  FS8  Deliver abutment & steel deck *+G00200  Shop drawings abut&steel deck  T  G01308  Forms & steel footing 01  G00780 +G01000  Deliver footing steel Drive piles abutment 01  G01408  Drive piles abutment 42  +C01880 G81100  G81500  Pour footing 41  G81388  G81680  Strip footing 01  +G01580  *G01200  *G81708  Forms & steel abutment 41  **COMO  Forms & steel footing 41  1  FS  N  1-  1 1  0  7  Forms & steel abutment Al  T  FS  N  1-  1 1  0  3  Excavate abutment 4Z Drive piles abutment 41  FS FS  N  1-  1 1  0  3  +G81400 +G01308  Drive piles abutment 42 Forms & steel footing 01  FS FS  N  1-  1 1  0  3  ON  G01480  Drive piles abutment 02  T  FS  N  1-  1 1  0  Z  FS^0  0^N  *+681700  Forms & steel abutment 01  T  FS  N  1-  1 1  0  15  T T  FS0 FS^0  ON ON  G01500  Pour footing 41  T  FS  N  1-  1 1  0  2  Drive piles abutment 01 Excavate abutment AZ  T T  FS^0 ISO  0^N ON  G81800  Forms & steel footing 42  T  F'S^8^0^N  1-  1 1  8  3  Forms & steel footing 01  T  FS^0  8^N  +G81600  Strip footing 41  T  FS^0^0^N  1-  1 1  0  1  Pour footing Al  T  FS^0  0^N  +G81000 * G01788  Forms & steel footing 42 Forms & steel abutment 41  T T  FS^8^8^N FS^0^0^N  1-  1 1  0  1  Deliver abutment & steel deck  T  FS^0  0^N  *+601900  Pour abutment 01  T  FS^8^0^N  1-  1 1  0  4  Page^Z Of 3 ACTIVITY CODE^DESCRIPTION  PREDECESSORS ACT. CODE DESCRIPTION G88608 G01688  G81888  Forms & steel footing *2  +G81680 G81408  TYPE PLOC DEL LAG^OFF/LOC  I^SUCCESSORS ACT. CODE  DESCRIPTION  TYPE SLOC DEL LAG^OFF/LOC  LOC_RANGE I^PROD. DATA I WORK SKIPDUR  Make abutment Forms Strip footing 41  T^FS^8 T^FS^8  0 0  Strip footing 41 Drive piles abutment 112  T^FS^8 T^FSO  B N ON  * G02800  Pour footing 42  T^FS^0  0^N  1-^1 1  8  2  Forms & steel abutment 111  T^FS^0  0  N  30G82180  Strip & cure abutment *1  T^FS^8  0^N  1-^1  8  2  FS^0  0  N  *+G02208  Strip footing 112  T^FSO  ON  1-^1  0  1  N N  *G81900  Pour abutment 41  *G82000  Pour footing 42  *G82180  Strip & cure abutment 41  *401900  Pour abutment 111  T^FS^0  0  N  +G83100 0G02488 * G82308  Rub concrete abutment *1 Forms & steel abutment 42 Backfill abutment 41  T^FS^8 T^FS^0 T^FS^O'  0^N 0^N 0^N  1-^1  8  3  *G82200  Strip footing 42  *402008  Pour footing 112  T^FS^0  0  N  *+GO2408  Forms & steel abutment *2  T^FSO  ON  1-^1 1  B  1  *G02300  Backfill abutment 41  * G02100  Strip & cure abutment 41  T^FS^8  B  N  x+GO2900 +G82088  Set girders Backfill abutment *2  T^FS^0 T^FSO  0^N 0N  1-^1 1  8  3  *G82488  Forms & steel abutment 112  *+G82100 *+G82280  Strip & cure abutment 41 Strip footing 112  T^FS^8 FS^B  B 0  N N  *+GO2580  Pour abutment 42  T^FSO  ON  1-^1  1  8  4  *G82500  Pour abutment 112  IK82400  Forms & steel abutment 4Z  T^FS^8  0  N  PG82680  Strip & cure abutment 42  T^FS0  ON  1-^1 1  8  Z  *G82600  Strip & cure abutment 112  **WHO  Pour abutment 42  T^FS^B  8  N  * G83300 **G82988 +G82800  Rub concrete abutment 42 Set girders Backfill abutment 42  T^FS^0 T^FS^0 T^FS^0  0^N 0^N 0^N  1-^1 1  0  3  Shop drawings girders  T^FS^0  0  N  * G02988  Set girders  T^FS^0  0^N  1-^1 1  B  25  *401708 GO1800  Forms & steel footing 112  G02700  Deliver girders  G82880  Backfill abutment 4Z  *402380 *+GO2688  Backfill abutment 41 Strip & cure abutment 42  T^FS^0 T^FS^8  0 0  N N  * G03200  Pour & cure deck  T^FS^0  0^N  1-^1 1  8  3  *G82900  Set girders  *+GO2380 *+GO2600 G82700  Backfill abutment Al Strip & cure abutment 112 Deliver girders  T^FS^0 T^FS^0 T^FSO  8 N 0 N ON  *483000  Deck Forms & steel  T^FS^B  ON  1-^1 1  B  2  *G83008  Deck forms & steel  *482900  Set girders  I^FS^0  0  N  *+G83208  Pour & cure deck  T^FS^8  8^N  1-^1 1  El  4  Rub concrete abutment Ill  *482108  Strip & cure abutment 41  T^FS^0  0  N  G03780 * G03608  Guardrail Painting  T^FSO T^FS^0  ON 0^N  1-^1 1  B  3  *G83200  Pour & cure deck  G02800 *483088  Backfill abutment 42 Deck forms & steel  T^FS^8 T^FSO  0 N ON  G83588 PG83400  Saw joints Strip deck  T^FS^0 T^FS^8  0^N 8^N  1-^1 1  B  3  *G83388  Rub concrete abutment 42  * G02680  Strip & cure abutment *2  T^FS^0  8^N  GO3700 PG83680  Guardrail Painting  T^FSO T^FS^0  8^N 8^N  1-^1 1  8  3  *G83400  Strip deck  0G83200  Pour & cure deck  T^FSO  ON  G83780 0603688  Guardrail Painting  T^FSO T^FS^0  ON 0^N  1-^1 1  B  3  G83500  Saw joints  * G03200  Pour & cure deck  T^FS^B  0  N  * G03888  Cleanup  T^FSO  ON  1-^1 1  D  1  Painting  G83180 *+GO3480 *+G03308  Rub concrete abutment *1 Strip deck Rub concrete abutment 42  T^FS^0 T^FS^0 T^FS  0 8 8  N N  *+G83800  Cleanup  T^FS^8  8^N  1-^1 i  B  5  G03108  *G83688  400688  N  Page^3  ACTIVITY CODE^DESCRIPTION  1^PREDECESSORS I ACT. CODE DESCRIPTION  I^SUCCESSORS TYPE FLOC DEL LAG^OFF/LOCII ACT. CODE DESCRIPTION  TYPE SLOC REL LAG^OFF/LOC  LOC_RANGE1 PROD. DATA 1 PORK SKIP DURI  Guardrail  G03100 * G83300 If G03400  Rub concrete abutment Al Rub concrete abutment A2 Strip deck  T^FS^0^0^N T^FS^0^8^N T^FS^0^0^N  * G83000  Cleanup  T^FS^0  *G83000  Cleanup  *+G03600 G83780 G03500  Painting Guardrail Saw joints  T^FS^0^0^N T^FS^8^0^N T^FS^0^8^N  *+G03900  Final^inspection  T^FSOON1-  *G83900  Final^inspection  *403080  Cleanup  T^FS^8^0^N  *484880  Contingency  T^FS^8  *G04080  Contingency  *403988  Final^inspection  T^FS^8^0^N  G83700  FOR A  TOTAL  OF 48 ACTIVITIES  8^N  0^N  1-^1 1  0^3  1 103  1-^1 1  0^1  1-^1 1  8^6  OF 3  ^ ^  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON M  Example Project from Clough and Sears Page 1 Of 3  duration & resources Pile Used: C:\REP2B0\PROJOG\CLOUGR  ACTIVITY CODE^DESCRIPTION  LOC_RANGE1 PROD. DATA 'RESOURCES ASSIGNED 'WORK SKIP DURIRES1 ABBREV DESCRIPTION  *G08100^Project Start  1-^1 1^0^0  CO8200^Shop drawings abut&steel deck  1 ^1 1^8^10  G00300^Shop dugs footing steel G00400  Move in  1-  1 1  0  3  1 1  0  15  688688  Shop drawings girders  1-  1 1  8  10  G80700  Deliver Footing steel  1-  1 1  0  7  G00808  Make abutment forms  1-  1 1  0  3  Drive piles abutment 111  DAY_RANGE^LEVEL  -  1-  G01000  AUG. USAGE AMOUNT  1 ^1 1^0^5  G00500  Excavate abutment 0 1  ACTIVITY RESOURCE USAGE ILOCJANGE^USAGE/UNITS  -  Deliver piles  688988  Report Date:^19APR93 Report Time:^14:26:09 Revision Number: 0 Progress Date:  * Critical Activity Governing predecessor of an activity or successor governed by activity  Select: All Activities Sort:^Activity Code  1-  1-  1 1  1 1  8  0  3  3  2  carp^carpenters  1  1 Rate:  men/day  2.00  1  3  2.00  1  lab^labourers  1  1 Rate:  men/day  4.00  1  3  4.00  3  equip^equipment operators  1  1 Rate:  men/day  1.00  1  3  1.0B  1  lab^labourers  1  1 Rate:  men/day  2.00  1  3  2.00  2  carp^carpenters  1  1 Rate:  men/day  2.00  1  3  2.00  1  lab^labourers  1  1 Rate:  men/day  6.00  1  3  6.00  3  equip^equipment operators  1  1 Rate:  men/day  1.00  1  3  1.00  1  lab^labourers  1  1 Rate:  men/day  4.00  1  3  4.08  2  carp^carpenters  1  1 Rate:  men/day  1.00  1  3  1.00  3  equip^equipment operators  1  1 Rate:  men/day  1.80  1  3  1.00  1  lab^labourers  1  1 Rate:  men/day  4.00  1  2  4.00  Excavate abutment 42  1-  1 1  0  Z  Deliver abutment & steel deck  1-  1 1  0  15  G01308  forms & steel footing Dl  1-  1 1  0  2  2  carp^carpenters  1  1 Rate:  men/day  3.00  1  Z  3.00  G81400  Drive piles abutment 4Z  1-  1 1  0  3  1  lab^labourers  1  1 Rate:  men/day  4.00  1  3  4.00  carp^carpenters  1  1 Rate:  men/day  1.00  1  3  1.00  equip^equipment operators  1  1 Rate:  men/day  1.00  1  3  1.00  G81100 *G81200  3  Page 2 Of 3 ACTIVITY DESCRIPTION CODE G01500  G01600 *G01700  G01000 *G01900  *G02000  Pour footing 111  LOC_RANGE PROD. DATA RESOURCES ASSIGNED WORK SKIP DURIRES4 ABBREV DESCRIPTION 1-  1 1  B  1  ACTIVITY RESOURCE USAGE LOC_RANGE^USAGE/UNITS  AUG. USAGE AMOUNT  DAY_RANGE^LEVEL  1  lab  labourers  1  1 Rate:  men/day  4.00  1  4.00  2  carp  carpenters  1  1 Rate:  men/day  1.00  1  1.00  3  equip^equipment operators  1  1 Rate:  men/day  1.08  1  1.80 2.BB  Strip footing 111  1-  1 1  B  1  1  lab  labourers  1  1 Rate:  men/day  2.00  1  Forms & steel abutment Al  1-  1 1  8  4  1  lab  labourers  1  1 Rate:  men/day  2.BB  1  4  2.08  2  carp  carpenters  1  1 Rate:  men/day  2.08  1  4  2.80  Forms & steel Footing 112  1-  1 1  B  2  2  carp  carpenters  1  1 Rate:  men/day  2.00  1  2  2.BB  Pour abutment 111  1-  1 1  B  2  1  lab  labourers  1  1 Rate:  men/day  6.00  1  2  6.00  2  carp  carpenters  1  1 Rate:  men/day  1.00  1  2  1.88  3  equip^equipment operators  1  1 Rate:  men/day  1.00  1  2  1.88  1  lab  labourers  1  1 Rate:  men/day  4.00  1  4.00  2  carp  carpenters  1  1 Rate:  men/day  1.00  1  1.BB  3  equip^equipment operators  1  1 Rate:  men/day  1.00  1  1.00  Pour footing 112  1-  1 1  B  1  *G02100  Strip & cure abutment 111  1-  1 1  B  3  1  lab  labourers  1  1 Rate:  men/day  1.00  1  *G02200  Strip footing 112  1-  1 1  B  1  1  lab  labourers  1  1 Rate:  men/day  2.00  1  *G02300  Backfill abutment 111  1-  1 1  0  3  1  lab  labourers  1  1 Rate:  men/day  3.BB  1  3  3.BB  *G02400  Forms & steel abutment 112  1-  1 1  0  4  1  lab  labourers  1  1 Rate:  men/day  2.00  1  4  2.00  2  carp  carpenters  1  1 Rate:  men/day  2.00  1  4  2.00  1  lab  labourers  1  1 Rate:  men/day  6.00  1  2  6.80  2  carp  carpenters  1  1 Rate:  men/day  1.80  1  2  1.88  3  equip^equipment operators  1  1 Rate:  men/day  1.88  1  2  1.BB  1  lab  labourers  1  1 Rate:  men/day  1.88  1  1  3.00  *G02500  Pour abutment 112  1-  1 1  B  2  1  3.80 2.00  Strip & cure abutment 112  1-  1 1  B  3  G02700  Deliver girders  1-  1 1  B  25  G02000  Backfill abutment 112  1-  1 1  B  3  1  lab  labourers  1  1 Rate:  men/day  3.88  1  3  3.00  Set girders  1-  1 1  0  2  1  lab  labourers  1  1 Rate:  men/day  3.00  1  2  3.88  3  equip^equipment operators  1  1 Rate:  men/day  1.88  1  2  1.88  1  lab  labourers  1  1 Rate:  men/day  3.00  1  4  3.88  2  carp  carpenters  1  1 Rate:  men/day  3.00  1  4  3.08  *G02600  *G02900  *G03000  Deck forms & steel  1-  1 1  8  4  Page 3 OF 3 ACTIVITY DESCRIPTION CODE  LOC_RANGEI PROD. DATA^'RESOURCES ASSIGNED WORK SKIP DURIRES4 ABBREV DESCRIPTION  ACTIVITY RESOURCE USAGE LOC_RANGE^USAGE/UNITS  AVG. USAGE AMOUNT  DAY_RANGE^LEVEL  Rub concrete abutment 41  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  1.08  1  3  1.08  *G83200  Pour & cure deck  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  6.00  1  3  6.00  *G83300  Rub concrete abutment 42  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  1.00  1  3  1.08  *G83400  Strip deck  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  3.08  1  3  3.00  G83500  Saw joints  1-^1 1  0  1  1  lab  labourers  1^1 Rate:  men/day  1.00  1  *G83608  Painting  1-^1 1  0  5  G03780  Guardrail  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  2.00  1  3  2.08  *G03800  Cleanup  1-^1 1  0  3  1  lab  labourers  1^1 Rate:  men/day  4.08  1  3  4.00  *G03900  Final^inspection  1-^1 1  0  1  *G04000  Contingency  1-^1 1  0  6  G83100  FOR A TOTAL OF 40 ACTIVITIES  1.08  REPCONTM  UBC CONSTRUCTION MANAGEMENT LAB Example Project from Clough and Sears  Page 1 Of 2  dates  File Used: C:\REP208\PROJ86\CLOUGH * Critical Activity 4. Governing predecessor of an activity or successor governed by activity  Select: All Activities Sort:^Activity Code  ACTIVITY CODE^DESCRIPTION *G00100  Project Start  *G00280  Shop drawings abut&steel deck  LOC 1^EARLY I RES. LEVELED I START^FINISH I START^FINISH  * 81MAR93^N/A *^1 01MAR93 12MAR93  01MAR93^N/A  FREE FLOAT TOTAL FLOAT 'LEVELED FLOAT' LATE START^FINISH NORMAL EXTRA NORMAL EXTRAINORMAL EXTRA T I N/A^N/A  N/A  N/A  N/A  N/A  N/A  N/A  01MAR93 12MAR93 01MAR93 12MAR93 0  N/A  0  N/A  0  N/A  G00300  Shop dwgs footing steel  1 01MAR93 05MAR93 81MAR93 05MAR93 12MAR93 18MAR93 0  N/A  9  N/A  9  N/A  G00400  Move in  1 0IMAR93 03MAR93 01MAR93 03MAR93 17MAR93 19MAR93 0  N/A  12  N/A  12  N/A  G80508  Deliver piles  1 01MAR93 19MAR93 01MAR93 19MAR93 04MAR93 24MAR93 8  N/A  3  N/A  3  N/A  G80600  Shop drawings girders  1 01MAR93 12MAR93 01MAR93 12MAR93 11MAR93 24MAR93 0  N/A  8  N/A  0  N/A  G80700  Deliver footing steel  1 88MAR93 16MAR93 88MAR93 16MAR93 19MAR93 29MAR93 6  N/A  9  N/A  9  N/A  G00880  Make abutment forms  1 04MAR93 08MAR93 09MAR93 11MAR93 31MAR93 02APR93 19  N/A  19  N/A  16  N/A  000900  Excavate abutment 4 1  1 84MAR93 08MAR93 04MAR93 08MAR93 22MAR93 24MAR93 0  N/A  12  N/A  12  N/A  G01000  Drive piles abutment Al  1 22MAR93 24MAR93 22MAR93 24MAR93 25MAR93 29MAR93 8  N/A  3  N/A  3  N/A  G01100  Excavate abutment 42  1 09MAR93 10MAR93 12MAR93 15MAR93 85APR93 86APR93 10  N/A  19  N/A  16  N/A  Deliver abutment & steel deck *^1 15MAR93 82APR93 15MAR93 OZAPR93 15MAR93 02APR93 0  N/A  0  N/A  0  N/A  G81300  Forms & steel footing *1  1 Z5MAR93 26MAR93 25MAR93 26MAR93 30MAR93 31MAR93 8  N/A  3  N/A  3  N/A  G01400  Drive piles abutment 42  1 25MAR93 29MAR93 25MAR93 29MAR93 07APR93 09APR93 1  N/A  9  N/A  9  N/A  681508  Pour footing *1  29MAR93 29MAR93 30MAR93 30MAR93 01APR93 81APR93 8  N/A  3  N/A  Z  N/A  G81608  Strip footing 41  1 30MAR93 30MAR93 31MAR93 31MAR93 82APR93 82APR93 0  N/A  3  N/A  2  N/A  *^1 85APR93 00APR93 85APR93 08APR93 85APR93 88APR93 0  N/A  0  N/A  0  N/A  1 31MAR93 01APR93 01APR93 0ZAPR93 12APR93 13APR93 0  N/A  8  N/A  7  N/A  *^1 09APR93 12APR93 09APR93 12APR93 09APR93 12APR93 8  N/A  0  N/A  0  N/A  02APR93 02APR93 14APR93 14APR93 14APR93 14APR93 0  N/A  8  N/A  0  N/A  *G01200  *G81700  Forms & steel abutment 11  G01080  Forms & steel footing 42  *G01900  Pour abutment Al  *G82008  Pour footing 42  *GOZ180  Strip & cure abutment Al  *^I 13APR93 15APR93 13APR93 15APR93 13APR93 15APR93 0  N/A  0  N/A  0  N/A  *G82208  Strip Footing 42  *^1 85APR93 85APR93 15APR93 15APR93 15APR93 15APR93 8  N/A  8  N/A  0  N/A  Report Date:^19APR93 Report Time:^14:34:33 Revision Number: 0 Progress Date:  Page 2 OF 2 ACTIVITY CODE^DESCRIPTION  LOCI^EARLY I RES. LEVELED LATE FREE FLOAT^FLOAT^FLOAT 'TOTAL^'LEVELED START^FINISH START^FINISH 1 START^FINISH 1 NORMAL EXTRA NORMAL EXTRA NORMAL EXTRA  C82300^Backfill abutment Al  *^1 16APR93 20APR93 26APR93 28APR93 2EAPR93 28APR93 6^N/A  6^N/A  0^N/A  *G02400^Forms & steel abutment 112  N^1  16APR93 21APR93 16APR93 21APR93 16APR93 21APR93 8^N/A  0^N/A  0^N/A  *G02500^Pour abutment 112  *^1 ZZAPR93 23APR93 22APR93 23APR93 22APR93 23APR93 0^N/A  0^N/A  8^N/A  *G02680^Strip & cure abutment 42  *^1 26APR93 28APR93 26APR93 28APR93 26APR93 28APR93 0^N/A  8^N/A  0^N/A  G02708^Deliver girders  1 15MAR93 16APR93 15MAR93 16APR93 25MAR93 20APR93 8^N/A  8^N/A  8^N/A  G02800^Backfill abutment 112  1 29APR93 03MAY93 29APR93 03MAY93 04MAY93 06MAY93 3^N/A  3^N/A  3^N/A  *G02980^Set girders  *^1 29APR93 30APR93 29APR93 30APR93 29APR93 30APR93 0^N/A  0^N/A  0^N/A  *G03880^Deck forms & steel  *^1 03MAY93 06MAY93 03MAY93 06MAY93 03MAY93 06MAY93 0^N/A  8^N/A  0^N/A  1 16APR93 20APR93 16APR93 28APR93 12MAY93 14MAY93 18^N/A  18^N/A  18^N/A  *G03200^Pour & cure deck  *^1 07MAY93 11MAY93 07MAY93 11MAY93 07MAY93 11MAY93 0^N/A  0^N/A  8^N/A  *G03300^Rub concrete abutment 112  *^1 29APR93 03MAY93 12MAY93 14MAY93 12MAY93 14MAY93 9^N/A  9^N/A  8^N/A  *G83400^Strip deck  *^1 12MAY93 14MAY93 12MAY93 14MAY93 12MAY93 14MAY93 0^N/A  0^N/A  0^N/A  G03500^Saw joints  1 12MAY93 12MAY93 17MAY93 17MAY93 21MAY93 21MAY93 7^N/A  7^N/A  4^N/A  *G03600^Painting  *^1 17MAY93 21MAY93 17MAY93 21MAY93 17MAY93 21MAY93 0^N/A  0^N/A  0^N/A  G03700^Guardrail  1 17MAY93 19MAY93 18MAY93 28MAY93 19MAY93 21MAY93 2^N/A  2^N/A  1^N/A  *G03800^Cleanup  *^1 24MAY93 26MAY93 24MAY93 26MAY93 24MAY93 26MAY93 0^N/A  0^N/A  0^N/A  *G03900^Final inspection  *^1 27MAY93 27MAY93 27MAY93 27MAY93 27MAY93 Z7MAY93 8^N/A  0^N/A  0^N/A  *G04000^Contingency  *^1 28MAY93 04JUN93 Z8MAY93 04JUN93 28MAY93 04JUN93 0^N/A  0^N/A  El^N/A  G03100^Rub concrete abutment 111  FOR A TOTAL OF 48 ACTIVITIES  I  ^ ^  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON TM  Example Project from Clough and Sears RESOURCE USAGE REPORT File Used: C:\REP288\PROJ06\CLOUGH Report Period: 81MAR93 - 04JUN93 Selected Resources. All Project Activities.  CLASS/SUBCLASS/RESOURCE Class: Usage: Rate  Unit: men/day  Deport Date: 19APR93 Report Time: 14:30:54 Progress Date: Revision Number: 0 DAILY/CUMULATIVE RESOURCE USAGE  ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative flL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative  Resource: labourers Usage: Rate^Unit: men/day^ES - Daily Cumulative Logistics:^ Used to level: No Weight: 1.00 LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily  01MAR93 02MAR93 83MAR93 04MAR93 05MAR93 06MAR93 07MAR93 08MAR93 09MAR93 10MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAI193 16MAR93 17MAR93 18MAR93 19MAR93 20MAR93 21MAR93 7.80^7.00^7.00^11.00^11.08^11.00^4.00^4.00^0.80^8.00^0.00^0.00^0.00^0.00^0.00 7.00^14.80^21.00^32.80^43.00^43.80^43.00^54.80^58.00^62.00^62.80^62.80^62.00^62.00^62.00^62.80^62.80 62.80 62.00 62.00 62.00 7.00^7.00^7.00 7.00^14.00^21.08^21.00^21.80 7.00^7.00^7.00^7.08^7.88^7.08^4.08^4.00^4.08^4.00^4.00^0.00^8.80^8.00^0.00 7.00^14.00^21.08^28.00^35.00^35.88^35.88^42.00^46.00^58.00^54.00^58.80^58.80^58.00^62.08^62.00^62.08^62.08^62.80^62.80^62.00 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 30MAR93 31MAR93 01API193 02APR93 03APR93 04API193 05APR93 86APR93 07APR93 08APR93 89APR93 10APR93 11APR93 6.80^6.00^6.00^9.00^9.00^12.00^2.00^2.08^2.80^6.00^6.00^4.08^4.00^4.80^8.80 68.00^74.00^80.08 89.00^98.00^98.80 98.00 110.00 112.00 114.00 116.08 122.80 122.00 122.88 128.00 132.80 136.80 140.00 148.00 148.08 148.00 7.00^7.00^7.00^6.08^6.08^6.08^3.80^7.88^18.00^6.00^8.00^8.00^10.08^10.80^14.00 28.00^35.00^42.00^48.00^54.00^54.80^54.80^60.08^63.00^70.00^80.00^86.00^86.00^86.00^94.00 182.00 112.00 122.00 136.00 136.00 136.08 6.00^6.00^6.00^9.00^9.00^6.00^6.00^2.00^2.00^2.08^----^4.00^4.00^4.00^4.00^8.00 68.80^74.00 80.00^89.88^98.88^98.00 98.00 104.88 110.00 112.80 114.00 116.08 116.08 116.80 120.00 124.80 128.08 132.00 140.00 140.80 140.80 12APR93 13APR93 14APR93 15APR93 16APR93 17APR93 18APR93 19APR93 20APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 01MAY93 02MAY93 8.00^3.00^0.00^0.00^8.00^8.00^8.00^4.00^8.08^8.88^3.00^0.00^8.80^8.00^8.00 156.08 159.00 159.00 159.88 167.80 167.00 167.00 175.80 183.80 187.00 195.08 203.00 203.80 283.00 206.08 206.00 206.00 214.08 222.00 222.80 222.00 10.08^5.00^6.00^2.00^4.00^4.00^4.00^4.00^8.00^8.00^6.00^3.00^3.00^4.00^4.00 146.00 151.00 157.80 159.00 163.00 163.80 163.00 167.00 171.00 175.00 183.08 191.80 191.00 191.00 197.80 208.00 203.00 207.00 211.00 211.00 211.00 8.80^3.00^6.00^2.08^5.00^5.00^5.00^4.80^8.00^8.08^6.00^3.80^3.00^7.00^7.00 148.00 151.00 157.08 159.00 164.00 164.80 164.80 169.00 174.00 178.00 186.00 194.00 194.00 194.00 200.00 203.00 206.00 213.00 228.00 220.00 220.00 03MAY93 04MAY93 05MAY93 06MAY93 07MAY93 08MAY93 09MAY93 18MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 18.00^6.00^6.00^6.00^6.08^6.80^6.00^4.00^3.00^3.00^2.08^2.88^2.80^0.00^0.00 232.00 238.00 244.00 250.00 256.00 256.00 256.08 262.00 268.00 272.00 275.00 278.00 278.00 278.80 280.00 282.00 284.00 284.00 284.08 284.00 284.08 6.00^9.00^9.08^9.00^6.00^6.80^6.00^5.00^5.00^5.00^0.00^0.00^2.00^2.00^3.80^----^-217.00 226.00 235.00 244.00 250.00 250.00 258.00 256.80 262.00 267.80 272.08 277.08 277.00 277.00 277.08 277.00 279.00 281.00 284.00 284.00 284.00 9.00^6.00^6.00^6.08^6.00^6.00^6.00^4.00^4.00^4.00^1.00^2.88^2.00^2.88^0.00 229.00 235.00 241.80 247.00 253.00 253.08 253.00 259.00 265.00 269.00 273.88 277.00 277.00 277.08 278.00 280.00 282.08 284.00 284.00 284.80 284.08 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 03JUN93 84JUN93 4.00^4.00^4.00^0.00^0.08^8.00^0.00^0.00^0.80^8.00 288.00 292.80 296.00 296.08 296.00 296.00 296.08 296.00 296.00 296.00 296.08 296.80 4.80^4.00^4.00^0.00^0.00^0.00^0.08^0.00^0.00^0.00 288.00 292.80 296.08 296.08 296.00 296.00 296.00 296.00 296.00 296.00 296.08 296.00 4.08^4.00^4.00^0.80^0.00^0.00^0.00^0.00^0.00^0.00 288.00 292.08 296.08 296.00 296.00 296.80 296.00 296.00 296.00 296.00 296.00 296.00 01MAR93 02MAR93 03MAR93 04MAR93 85MAR93 86MAR93 07MAR93 08MAR93 89MAR93 10MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 19MA1193 20MAR93 21MAR93 4.00^4.80^4.08^8.00^8.00^8.00^4.80^4.00^0.08^8.00^0.00^0.00^0.08^0.00^0.00 4.00^8.00^12.00^20.00^28.00^28.88^28.00^36.00^40.08^44.00^44.00^44.08^44.00^44.80^44.00^44.00^44.00^44.00^44.00^44.00^44.00 4.00^8.00^12.00^12.00^12.08 4.00^4.80^4.80^6.00^6.00^6.00^2.00^2.00^2.80^4.00^4.00^0.00^0.00^0.00^0.00 4.00^8.08^12.00^18.00^24.00^24.08^24.80^30.08^32.00^34.80^36.08^40.08^40.00^40.00^44.00^44.08^44.00^44.00^44.00^44.80^44.00 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 38MAR93 31MAR93 01APR93 02APR93 03APR93 84APR93 05APR93 06API193 07APR93 88APR93 09AP1193 10APR93 11APA93 4.00^4.00^4.00^4.00^4.00^8.00^2.00^0.00^0.00^4.00^4.00^2.00^2.00^2.00^6.00 48.00^52.00^56.00^60.00^64.00 64.00^64.80^72.80^74.00^74.80^74.08^78.80^78.88^78.00^82.00^84.00^86.00^88.08^94.88^94.00^94.00 6.80^6.00^6.00^4.00^4.80^4.00^0.08^2.00^6.80^4.00^6.00^6.00^6.00^6.00^MOO 18.00^24.00^30.08 34.88^38.08^38.00^38.00^42.00^42.00^44.00^50.80^54.00^54.00^54.80 60.00^66.00^72.00^78.00^88.00^88.00 88.80 4.08^4.00^4.00^4.00^4.00^4.00^4.00^2.00^0.00^0.00^2.00^2.88^2.08^2.80^6.00 48.00^52.00^56.00^60.00^64.00^64.00^64.00^68.00^72.00^74.80^74.88^74.80^74.00^74.00^76.88^78.00^80.00^82.00^88.88^88.00^88.00 12APR93 13APR93 14APR93 15APR93 16APA93 17APR93 18APR93 19APR93 28APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APA93 29APR93 30API193 01MAY93 02MAY93 6.00^3.80^8.88^0.80^6.08^6.00^6.00^2.80^6.00^6.00^----^3.00^0.00^8.00^7.80^7.08  ^ ^  Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative Resource: carpenters Usage: Rate^Unit: men/day^ES - Daily Logistics: Cumulative Used to level: No Weight: 1.00 LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative Resource: equipment operators Usage: Rate^Unit: men/day^ES - Daily Cumulative Logistics:^ Used to level: No Weight: 1.80 LS - Daily Cumulative AL - Daily Cumulative ES - Daily  •  100.00 103.00 103.00 103.00 109.00 109.00 189.00 115.00 121.00 123.80 129.80 135.80 135.00 135.00 138.80 138.00 138.00 145.00 152.08 152.88 152.80 6.00^3.88^4.00^2.00^2.80^2.80^2.08^2.08^6.88^6.00^6.00^3.00^3.00^3.80^3.00 94.88^97.00 101.00 103.00 105.88 105.00 105.00 107.08 109.00 111.00 117.00 123.80 123.80 123.08 129.00 132.00 135.00 130.00 141.00 141.00 141.00 6.00^3.80^4.00^2.88^3.08^3.00^3.00^2.00^6.00^6.80^6.00^3.00^3.00^6.00^6.08 94.00^97.88 181.80 103.08 106.00 106.80 106.88 189.88 112.88 114.08 120.88 126.00 126.00 126.00 132.80 135.00 138.00 144.88 150.00 158.80 158.00 B3MAY93 84MAY93 05MAY93 86MAY93 B7MAY93 08MAY93 89MAY93 1BMAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 7.00^3.00^3.00^3.00^6.00^6.BB^6.00^4.00^3.00^3.08^2.00^2.00^2.80^0.00^8.80 159.88 162.00 165.08 168.00 174.08 174.80 174.88 180.08 106.08 190.08 193.88 196.00 196.80 196.00 198.88 280.80 202.00 202.00 202.00 202.00 202.00 3.00^6.00^6.00^6.08^6.08^6.BB^6.00^5.00^5.00^5.08^0.00^0.00^2.00^2.00^3.00 144.88 158.08 156.08 162.00 168.00 168.80 168.80 174.88 180.88 185.88 190.80 195.00 195.00 195.00 195.00 195.80 197.00 199.88 282.88 202.00 282.08 6.00^3.00^3.00^3.0B^6.08^6.88^6.00^4.00^4.00^4.88^1.88^2.88^2.00^2.08^8.00 156.80 159.80 162.08 165.88 171.80 171.00 171.80 177.00 183.00 187.80 191.80 195.08 195.00 195.00 196.00 190.00 280.08 202.00 202.00 282.80 282.00 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 83JUN93 04JUN93 4.00^4.00^4.00^8.80^0.08^B.BB^0.08^0.00^B.BB^8.80 206.80 210.80 214.00 214.08 214.00 214.08 214.00 214.00 214.00 214.00 214.80 214.08 4.80^4.80^4.88^0.00^0.08^8.00^0.80^8.00^BOB . ^8.00 206.00 210.00 214.00 214.00 214.08 214.00 214.00 214.08 214.00 214.00 214.00 214.80 4.80^4.88^4.00^BOB . ^B.BB^0.00^8.00^B.BB^8.00^0.00 206.00 218.00 214.88 214.00 214.00 214.80 214.88 214.80 214.80 214.00 214.08 214.00 81MAR93 82MAR93 03MAR93 B4MAR93 05MA1193 86MAR93 07MAR93 08MAR93 09MAR93 10MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 19MAR93 ZOMAR93 21MAR93 2.00^2.00^2.88^2.00^2.00^2.08^8.00^0.00^BOB . ^8.00^----^8.08^0.00^0.00^8.80^OM 2.80^4.80^6.00^8.00^10.88^10.00^10.00^12.08^12.00^12.00^12.00^12.88^12.00^12.00^12.00^12.80^12.80^12.00^12.80^12.00^12.00 2.0B^4.88^6.80^6.00^6.00 2.88^2.08^2.88^0.88^0.00--------BOB . ^2.00^2.00^2.00^B.08^0.80^8.88^0.88^0.00^0.88 2.00^4.00^6.00^6.00^6.00^6.00^6.08^6.88^8.88^10.88^12.08^12.00^12.00^12.00^12.08^12.00^12.00^12.08 ^12.00^12.00^12.80 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 38MAR93 31MAR93 01APR93 82APR93 03AP1193 04APR93 05APR93 06API193 07APR93 B8APR93 09APR93 10API193 11APR93 1.08^1.00^1.08^4.00^4.00^2.00^8.80^2.00^2.80^1.08^2.08^2.88^2.00^2.00^1.00 13.00^14.80^15.00^19.80^23.88^23.00^23.00^25.08^25.08 27.88 29.88^38.80^38.08^30.00^32.00^34.00^36.08^38.88^39.00^39.00^39.88 0.00^8.00^0.08^1.88^1.00^1.00^3.80^5.00^3.80^2.08^2.00^2.88^3.88^3.00^2.00 6.00^6.80^6.00^7.00^8.80^8.08^8.88^9.88^12.88^17.88^20.08^22.00^22.00^22.00^24.88^26.00^29.00^32.80^34.08^34.00^34.80 1.88^1.00^1.88^4.08^4.80^1.00^1.00^0.80^2.00^2.88^2.08^2.00^2.88^2.00^1.00 13.00^14.00^15.00^19.00^23.00^23.00^23.88^24.00^25.88^25.00^27.08^29.88^29.00^29.08^31.88^33.88^35.00^37.08^38.08^38.00^38.80 12APA93 13APR93 14APR93 15APR93 16APR93 17APR93 18API193 19APA93 28APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 81MAY93 02MAY93 1.00^0.00^0.00^0.08^2.00^2.00^2.00^2.00^1.80^1.08^8.00^8.00^BOB . ^8.00^0.00 48.80^40.00^40.00^48.80^42.80^42.88^42.88 44.88^46.88^48.00^49.08^50.00^50.00^50.08^50.00^58.88 50.00^58.80 50.80 58.00^58.00 3.08^2.08^1.88^0.08^2.08^2.00^2.08^2.00^1.08^1.88^0.08^0.00^8.88^8.88^8.08 37.00^39.80^40.00^40.00^42.00^42.08^42.80^44.00^46.00^48.00^49.00^58.08^50.00^50.88^50.80^50.00^50.08^50.00^50.00^50.08^58.08 1.88^8.88^1.00^0.80^2.88^2.88^2.88^2.88^1.88^1.80^0.80^8.08^0.08^8.00^0.B0 39.00^39.00^40.08^40.88^42.00^42.00^42.00^44.00^46.00^48.80^49.80^50.00^50.80^58.00^50.00^58.00^50.00^58.00^50.00^50.00^50.88 83MAY93 04MAY93 05MAY93 06MAY93 B7MAY93 08MAY93 89MAY93 1BMAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 3.00^3.00^3.08^3.80^0.88^8.08^8.80^0.08^0.08^0.88^0.08^0.00^0.08^B.88^0.88 53.08^56.80 59.00^62.00^62.00^62.80^62.80^62.00^62.00^62.00^62.80^62.08^62.88^62.08^62.80^62.00^62.88^62.00^62.80 62.08^62.88 3.00^3.00^3.88^3.88^0.08^8.88^B.B8^0.88^B.B8^B.00^----^0.08^0.00^0.08^0.80^0.00 53.80^56.88 59.00^62.00^62.00^62.08^62.80 62.00^62.00^62.00^62.00^62.08^62.00^62.08^62.00^62.08^62.88^62.00^62.00^62.00^62.00 3.00^3.00^3.88^3.80^0.88^8.88^0.88^0.88^0.08^0.08^----^0.80^0.80^0.00^0.88^0.88 53.88^56.88 59.00^62.00^62.00^62.00^62.00^62.00^62.00^62.00^62.00^62.00^62.88^62.88^62.08 62.00^62.88^62.00^62.00^62.88^62.08 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 03JUN93 04JUN93 8.80^0.00^0.00^0.00^BOB . ^0.00^BOB . ^0.8B^8.0B^0.08 62.00^62.88 62.00^62.80^62.08^62.88 62.08 62.80^62.08^62.08^62.00^62.80 8.88^BOB . ^0.00^0.08^0.08^0.00^8.00^8.00^8.80^8.00 62.80^62.08 62.80^62.00^62.80^62.88^62.08 62.00^62.88^62.80^62.00^62.00 8.00^0.00^0.00^0.08^0.00^0.08^8.80^0.80^8.00^0.08 62.80^62.00 62.00^62.00 62.00^62.08^62.88^62.08^62.88^62.00^62.08^62.00 01MAR93 02MAR93 03MAR93 84MAR93 85MAR93 86MAR93 07MAR93 08MAR93 09MAR93 18MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 19MAR93 20MAR93 21MAR93 1.80^1.88^1.00^1.00^1.80^1.00^0.88^0.80^0.08^0.80^0.88^8.80^8.80^0.08^0.00 1.00^2.08^3.80^4.80^5.88^5.80^5.00^6.00^6.88^6.88^6.08^6.88^6.08^6.00^6.08^6.08^6.88^6.00^6.88^6.88^6.00 1.00^1.00^1.00 1.00^2.88^3.80^3.88^3.00 1.00^1.88^1.88^1.00^1.80^1.00^0.88^0.88^8.00^0.08^0.88^0.00^0.80^0.00^8.00^--1.08^2.00^3.00^4.88^5.08^5.80^5.00^6.88^6.00^6.00^6.08^6.00^6.00^6.88^6.00^6.00^6.00^6.013^6.88^6.00^6.00 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 30MAR93 31MAR93 01APR93 02APR93 03APR93 04APR93 05APR93 06APR93 07APR93 08APR93 09APR93 18APR93 11APR93 1.00^1.00^1.00^1.88^1.08^2.00^8.00^0.00^8.88^1.80^0.00^0.08^0.00^0.88^1.00  Cumulative LS - Daily Cumulative RL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative RL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative RL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative RL - Daily Cumulative  7.00^8.08^9.80^10.00^11.80^11.00^11.00^13.00^13.00^13.00^13.08^14.00^14.00^14.00^14.00^14.00^14.08^14.00^15.00^15.00^15.80 1.00^1.00^1.00^1.00^1.08^1.08^0.00^0.08^1.08^8.00^8.80^0.00^1.00^1.00^2.00 4.00^5.00^6.00^7.00^0.00^8.00^8.08^9.00^9.08^9.00^18.08^10.00^10.80^18.80^10.00^10.00^11.00^12.00^14.00^14.00^14.88 1.08^1.08^1.88^1.00^1.00^1.00^1.80^8.00^0.00^0.80^0.00^0.00^8.88^8.88^1.88 7.00^8.08^9.80^18.80^11.88^11.00^11.00^12.80^13.00^13.00^13.00^13.08^13.80^13.88^13.00^13.08^13.00^13.00^14.00^14.00 ^14.80 12APR93 13APR93 14APR93 15APR93 16APR93 17APR93 18APR93 19APR93 20APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 01MAY93 EMAY93 1.80^0.00^8.00^0.00^0.00^0.08^B.00^0.00^1.00^1.00^0.00^0.00^OM^1.00^1.00 16.80^16.00^16.08^16.00^16.00^16.00^16.08^16.00^16.08^16.00^17.08^18.88^18.08^18.00^18.00^18.80^18.00^19.00^20.00^20.80^20.80 1.00^0.00^1.00^0.00^8.80^0.00^0.00^0.00^1.00^1.00^0.00^0.08^0.00^1.00^1.80 15.00^15.00^16.00^16.00^16.00^16.80^16.00^16.80^16.00^16.00^17.00^18.00^18.00^18.00^18.00^18.00^10.80^19.00^20.00^20.00^28.00 1.80^0.08^1.00^0.80^0.00^0.08^0.00^0.80^1.80^1.00^0.00^0.00^0.08^1.00^1.00 15.00^15.00^16.80^16.00^16.00^16.08^16.08^16.00^16.08^16.00^17.08^18.00^18.00^18.00^18.00^18.00^18.00^19.00^20.80^28.80^28.00 03MAY93 04MAY93 05MAY93 06MAY93 87MAY93 08MAY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 0.00^0.00^0.00^0.00^0.80^8.00^0.88^8.00^0.00^0.00^0.00^0.00^8.80^0.80^0.08 28.00^28.00 20.00^28.00^20.08 20.00^20.00^20.00^20.00^28.00^20.00^20.00^20.08^20.08 20.00^20.00^20.00^28.00^20.08^20.80 20.00 0.88^0.08^8.00^0.80^0.00^0.00^0.00^0.00^0.00^0.00^0.00^0.00^0.08^0.00^0.00 ZHAO^20.00^20.80^20.00^28.00^20.00^20.08^20.08 20.00^20.80^20.80^28.00^20.00^20.00^20.00^20.80^20.00^20.00^20.00 20.00^20.80 0.00^0.00^0.00^0.08^8.00^0.00^0.88^0.00^0.08^0.00^-^0.08^0.00^0.00^0.08^0.00 28.00^20.00^28.00^20.00^20.88 20.00^28.00^20.00^20.00 20.00^20.00^20.00^20.08^20.00^20.08^20.00^20.00^20.00^20.00^20.00^20.00 24MAY93 25MAY93 26MAV93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 03JUN93 04JUN93 0.08^0.00^0.00^0.00^0.00^0.08^0.00^8.00^8.08^0.00 20.00^20.00^20.00 20.00^28.00 20.00^20.00^28.00^20.00^28.00^20.00^20.00 0.00^0.00^0.00^0.08^0.80^8.00^8.88^0.08^0.08^0.00 20.00 28.00 20.00 20.80 20.00 28.00 20.00 20.00 20.00 MOO 20.00 20.00 8.88^8.88^0.00^0.00^0.00^0.08^0.00^0.00^8.00^0.00 20.00^20.08^20.88^20.00^20.00 20.00^20.00^20.80^Z0.00^28.00^20.00^20.00  ^  REPCON TM  UBC CONSTRUCT CONSTRUCTION MANAGEMENT LAB Example Project from Clough a n d S e a r s  File Used: C:\REPCON2\PROJ03\CLOUGH Report Period: 01MAR93 - 04JUN93 Selected Resources. All Critical Activities.  •  CLASS/SUBCLASS/RESOURCE ^  RESOURCE USAGE REPORT  Report Date: 01APR93 Report Tine: 16:13:55 Progress Date: Revision Number: 0 DAILY/CUMULATIVE RESOURCE USAGE  Class: labour 01MAR93 02MAR93 03MAR93 04MAR93 05MAR93 86MAR93 07MAR93 08MAR93 89MAR93 10MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 19MAR93 20MAR93 21MAR93 ^ Usage: Rate^Unit: men/day ES - Daily - Cumul. LS - Daily - Cumul. RL - Daily - Cumul. 22MAR93 23MAR93 24MAR93 2511A1193 26MAR93 27MAR93 28MAR93 29MAR93 30MAR93 31MAR93 01APR93 02APR93 03APR93 04APR93 05APR93 06APR93 07APR93 08APR93 09APR93 10APR93 11APR93 ES - Daily - Cunul. 4.00^8.00^12.00 16.00 24.00 24.00 ^24.00 LS - Daily 4.00^4.00^4.08^4.00^8.00 - Cunul. 4.00^0.08 12.00^16.00 24.00 24.00 24.00 RL - Daily 4.08^4.00^4.00^4.00^8.00 - Cumul. 4.00^8.08 12.00^16.00 24.00 24.00 24.00 12APR93 13APR93 14APR93 15APR93 16APR93 17APR93 18APR93 19APR93 20APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 01MAY93 82MAY93 ES - Daily 8.08^3.00^0.88^0.88^4.08^----^4.00^4.00^4.80^8.00^8.00^--^----^3.00^0.08^0.00^4.00^4.08^---- Cunul. 32.08 35.00 35.00 35.00 39.00 39.00 39.00 43.00 47.00 51.08 59.00 67.00 67. ^67.00 70.00 70.00 78.00 74.08 78.00 70.08 70.00 LS - Daily 8.80^3.08^0.80^8.80^4.00^----^4.00^4.00^4.00^8.00^8.00^3.80^0.00^0.08^4.00^4.80^---- Cunul. 32.08 35.00^35.00^35.00^39.00 39.80 39.00 43.00^47.^51.08 59.00 67.80 67.00 67.00 70.08 70.08^70.00 74.00 78.00^78.00^78.00 RL - Daily 8.00^3.08^0.00^0.00^4.00^----^4.80^4.00^4.00^8.00^8.00^3.00^0.00^0.00^4.00^4.08 - Cumul. 32.00^35.00^35.00^35.00^39.08 39.00 39.00^43.08 47.00 51.00 59.00 67.00^67.00 67.00 70.00 70.00 78.00^74.00^78.80 78.00^78.08 03MAY93 04MAY93 05MAY93 06MAY93 07MAY93 88MAY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 ES - Daily 6.00^6.00^6.00^6.00^6.00^6.80^6.00^3.00^3.00^3.80^----^0.00^0.00^0.00^0.00^0.08 - Cumul. 84.80 90.00 96.88 102.00 108.88 188.00 108.80 114.00 120.08 123.00 126.80 129.00 129.00 129.00 129.00 129.00 129.00 129.00 129.00 129.00 129.80 LS - Daily 6.08^6.00^6.00^6.00^6.08^----^6.88^6.00^3.00^3.00^3.00^0.00^8.08^0.88^0.00^0.00 - Cumul. 84.80 98.00 96.00 102.00 108.80 108.08 188.00 114.00 120. s 123.00 126.00 129.08 129.00 129.00 129.00 129.00 129.00 129.00 129.00 129.80 129.00 RL - Daily 6.00^6.00^6.00^6.00^6.00^6.00^6.00^3.00^3.00^3.00^----^8.08^0.00^0.08^0.00^0.00 - Cumul. 84.88 90.00 96.80 102.00 108.00 188.00 108.00 114.80 120.00 123.00 126.00 129.00 129.08 129.00 129.80 129.80 129.08 129.00 129.00 129.08 129.00 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 03JUN93 04JUN93 ES - Daily 4.00^4.08^4.00^0.00^0.80^0.00^0.00^0.00^0.00^0.00 - Cumul. 133.00 137.00 141.00 141.00 141.00 141.00 141.08 141.00 141.80 141.00 141.00 141.00 LS - Daily 4.00^4.00^4.00^0.00^0.88^0.08^8.80^8.08^0.00^0.00 - Curl. 133.00 137.80 141.00 141.00 141.08 141.08 141.00 141.00 141.80 141.80 141.00 141.00 RL - Daily 4.00^4.00^4.80^0.00^0.80^0.00^8.00^0.00^0.00^0.80 - Curl. 133.00 137.00 141.00 141.00 141.00 141.08 141.00 141.00 141.08 141.88 141.00 141.00 Resource: labourers 8IMAR93 02MAR93 03MAR93 04MAI193 05MAR93 06MAR93 07MAR93 08MAR93 09MA1193 10MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 10MAR93 19MAR93 20MAR93 21MAR93 Usage: Rate^Unit: men/day^ES - Daily Logistics:^ - Cumul. Used to level: No Weight: 1.00^LS - Daily - Cumul. AL - Daily - Cumul. 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 20MAR93 29MAR93 30MAR93 31MAR93 01APR93 02 2APR93 03APR93 04APR93 05APR93 86APR93 07APR93 08APR93 89APR93 10APR93 11APR93 ES - Daily - Cumul. 2.00^4.00^6.00^8.00^14.00^14.00^14.00 LS - Daily 2.00^2.08^2.00^2.00^6.00 - Curl. 2.80^4.08^6.80^8.00^14.00^14.88 14.00 RL - Daily - -^ 2.00^2.00^2.80^2.08^6.08 - Curl. 2.00^4.00^6.00^8.00^14.80^14.00^14.00 12APR93 13APR93 14APR93 15APR93 16APR93 17APR93 18APR93 19APR93 20APR93 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 81MAY93 02MAY93 ES - Daily 6.88^3.00^0.00^0.80^2.00^2.00^2.00^2.00^6.80^6.00^3.08^8.00^0.00^3.80^3.00  ^  - Cumul. LS - Daily - Cumul. AL - Daily - Cumul. ES - Daily - Cumul. LS - Daily - Cumul. AL - Daily - Cumul. ES - Daily - Cumul. LS - Daily - Cumul. AL - Daily - Cumul.  28.00 23.08^23.00^23.00^25.08 25.00 25.00^27.80^29.00 31.00^37.00 43.00^43.80^43.00 46.08^46.00 46.00 49.08 52.08 52.00^52.80 6.00^3.00^0.00^0.00^2.00^2.00^2.00^2.00^6.08^6.08^3.88^8.00^BOB . ^3.80^3.00^---23.08^23.00 23.08^25.88 25.00 25.00^27.80 29.00 31.80 37.08 43.00 ^43.08^43.00 46.08 46.00 46.00 49.00 52.00 52.00 ^52.08 6.00^3.08^0.00^0.80^2.00^----^2.00^Zi.^2.08^6.00^6.88^----^----^3.08^0.00^0.00^3.00^3.80^---23.00 23.00 23.00 25.00 25.00 25.88 27.08 29.00 31.00 37.00 43.80 43.00 43.00 46.80 46.80 46.00 49.00 52.00 52.80 ^52.00 03MAY93 04MAY93 05MAY93 06MAY93 87MAY93 08MAY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 3.00^3.00^3.80^3.08^6.00^6.00^6.80^3.80^3.00^3.00^0.00^0.80^0.00^0. 88 55.08 58.08 61.00 64.80 ^70.00^70.80 70.00^76.00 82.00 85.00^88.00^91.00^91.00^91.00 91.80 91.00 91.00 91.08 91.00^91.80^91.80 3.00^3.00^3.00^3.08^6.08^6.80^6.00^3.88^3.08^3.00^0.08^8.08^0.88^0.00 55.80 58.08 61.00 64.80 ^70.00^70.08^70.00^76.80 82.00 85.00^88.00^91.00^91.08^91.08^91.08 91.00 91.00 91.80 91.00 91.00^91.80 3.80^3.00^3.80^3.00^6.08^6.00^6.::^3.80^3.00^3.00^8.00^0.88^0.08^0.00 55.00 58.00^61.00 64.00^78.00 70.08^70.00 76.00 82.00 85.00 88.80 91.80 91.00 91.80 ^91.80 91.80 91.80 91.00 91.80 91.00^91.08 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 38MAY93 31MAY93 01JUN93 02JUN93 83JUN93 04JUN93 4.00^4.88^4.00^0.00^0.00^----^----^8.00^0.00^8.08^0.80^0.88 95.08 99.80 103.00 103.80 103.80 183.00 183.00 103.08 103.80 103.00 103.08 103.00 4.00^4.08^4.08^0.08^0.00^0.00^8.00^0.08^0.08^8.88 95.80^99.00 183.00 103.00 103.08 183.88 103.08 183.88 103.00 103.08 103.88 103.80 4.00^4.00^4.80^0.00^0.00^0.08^8.00^8.08^0.80^8.88 95.80^99.88 183.00 103.80 103.80 183.80 183.00 103.00 103.00 103.00 103.80 103.08  Resource: carpenters 01MAR93 02MAR93 03MAR93 04MAR93 05MAR93 86MAR93 8714893 8818893 09MA193 1011A893 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 1818893 19MAR93 20MAR93 21MAR93 Usage: Rate^Unit: men/day^ES - Daily - Cumul. Logistics:^ Used to level: No Ueight: 1.00 ^LS - Daily - Cumul. AL - Daily - Cumul. 22MAR93 23MAR93 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 30MR93 31t1A1193 01APR93 02APR93 03APR93 04APR93 05APR93 06APR93 07APA93 08APR93 09API193 18AP1193 11APR93 ES - Daily - Cumul. 2.00^4.00^6.80^8.ss^9.00^9.00^9.00 LS - Daily Z.^2.88^2.80^2.00^1.00^----^---- Cumul. 2.00^4.08^6.08^8.80^9.00^9.08^9.00 AL - Daily ----^2.00^2.00^2.00^2.08^1.00^---- Cumul. 2.08^4.00^6.00^8.00^9.08^9.88^9.00 12APR93 13APR93 101193 15APR93 16APA93 17APR93 18APR93 19APR93 20APR93 21APR93 ZZAPR93 23APR93 24APA93 25APR93 26APR93 27APR93 Z8APR93 29APA93 38APR93 B1MAY93 02MAY93 ES - Daily 1.00^0.00^0.80^0.00^2.88^2.80^2.08^2.80^1.88^1.80^0.00^0.00^8.00^0.00^0.00 - Cumul. 18.08^10.88^10.80 18.88^12.00^12.00 12.80^14.80 16.00^18.80^19.00 20.80 20.00 20.80 28.^20.^20.00 20.00^28. s s^20.80^20. LS - Daily 1.00^8.00^8.00^8.80^2.00^----^2.08^2.88^2.80^1.00^1.00^----^0.88^0.00^8.80^0.80^0.00^---- Cumul. 10.00 10.00 10.00 12.08 12.00 12.00 14.80 16.88 18.00 19.08 28.00 28.80 20.08 20.00 28.80 20.00 20.08 20.08 20.08 20.00 AL - Daily 1.08^0.00^O. s s^B. s s ^2.00^2.00^2.00^2.88^1.00^1.00^0.08^0.00^0.00^0.00^0.80 - Cumul. 10.08^10.88^18.00 10.80^12.00^12.08 12.80^14.00 16.00^18.08^19.00^28.88 28.80 20.00 20.80 20.00 20.80^20.00 20.00^20.08^20.00 03MAY93 84MAY93 05MAY93 06MAY93 07MAY93 88M8Y93 09M8Y93 18MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15M1Y93 16M0Y93 17MAY93 18MAY93 19MAY93 28MAY93 21MAY93 22MAY93 23MAY93 ES - Daily 3.88^3.00^3.08^3.80^8.00^----^8.00^8.00^0.00^0.80^8.88^0.88^8.00^8.00^0.0B^0.00 - Cumul. 23.80 26.00 29.00 32.00 32.00 32.80 32.08 32.08 32.00 MOO 32.00 32.00 32.80 32.00 32.00 32.08 32.00 32.00 32.00 32.00 32.00 LS - Daily 3.00^3.80^3.80^3.88^8.00^----^0.00^0.00^0.00^0.88^8.00^----^0.80^0.00^8.00^0.00^0.08 - Cumul. 23.00 26.00 29.00 32.00 32.00 32.80 32.00 32.88 32.80 32.00 32.00 32.80 32.00 32.00 32.80 32.80 32.00 32.00 32.80 32.00 32.00 AL - Daily 3.08^3.80^3.::^3.00^8.08^0.00^0.00^0.00^0.00^0.00^----^0.88^8.00^8.80^0.00^0.80 - Cumul. 23.00 26.00 29.80 32.00 32.08 32.00 32.08 32.00 32.00 32.00 MOO 32.08 32.08 32.88 32.00 32.80 32.00 32.88 32.00 32.00 32.00 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01JUN93 02JUN93 03JUN93 04JUN93 ES - Daily 0.00^0.88^0.80^0.88^8.00^0.80^8.00^8.00^0.00^8.80 - Cumul. 32.00 32.00 32.88 32.08 32.00 32.08 32.00 32.00 32.00 32.00 32.08 32.00 8.00^8.80^8.00^0.00^0.00^0.08^0.00^8.00^O.ss^0.00 LS - Daily - Cumul. 32.08 32.00 32.00 32.00 32.00 MOO 32.08 32.80 32.00 32.:;^32.00 32.80 AL - Daily 0.00^8.08^0.80^0.00^0.08^0.00^8.^0.08^0.00^0.00 - Cumul. 32.00 32.80 32.08 32.00 32.00 32.08 32.80 32.00 32.00 32.00 32.08 32.00 Resource: equipment operators 01MAR93 0218893 03MAR93 04MAR93 05MAR93 06MAR93 87MAR93 08MAR93 89MAR93 101AR93 11MAR93 12MAR93 1318893 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 1918893 20MAR93 21M0R93 Usage: Rate^Unit: men/day^ES - Daily - Cumul. Logistics:^ Used to level: No^Ueight: 1.80^LS - Daily - Cumul. AL - Daily - Cumul. 22MAR93 23MAR93 24MA193 25MAR93 26MAR93 2711AR93 22MAR93 29MAR93 30MAR93 31MAR93 01APR93 82APR93 03APR93 04APR93 05APR93 06AP1193 87APR93 88APA93 09AP1193 10AP1193 11AP1193 ES - Daily 1.00^----  ^  - Cumul.  1.00^1.88^1.08 1.00 1.00^1.00^1.08  LS - Daily - Cumul.  RL - Daily - Cumul.  ES - Daily - Cumul.  LS - Daily - Cumul.  RL - Daily - Cumul.  ES - Daily - Cumul.  LS - Daily - Cumul.  AL - Daily  - Cumul.  ES - Daily - Cumul.  LS - Daily - Cumul.  RL - Daily - Cumul.  1.00^1.00^1.08 12APR93 13APR93 14APR93 15APR93 16APR93 17APR93 18APR93 19APR93 20APR93 21APR93 22APR93 23093 24APR93 25APR93 26A11193 27APR93 28APR93 29APR93 38APR93 01MAY93 02MAY93 1.80^0.00^8.80^0.80^0.08^0.08^0.00^0.00^1.08^1.00^0.00^0.00^0.80^1.08^1.00 2.00^2.80^2.00^2.08^2.00^2.00^2.00^2.00^2.80^2.00^3.00^4.08^4.08^4.00^4.80^4.88^4.00^5.00^6.00^6.00^6. 1.08^0.00^0.00^0.00^0.00^0.00^0.00^0.00^1.80^1.80^----^8.80^0.80^0.08^1.00^1.80 2.00^2.00^2.00^2.00^2.00^2.80^2.00^2.08^2.80^2.00^3.80^4.00^4.08^4.00^4.00^4.80^4.00^5.00^6.00^6.08^6.08 1.00^0.08^8.80^8.00^0.;;^0.00^0.08^0.08^1.00^1.80^0.00^0.00^0.08^1.00^1.08 2.00^2.00^2.00^2.00^2.00^2.00^2.00^2.00^2.00^2.00^3.00^4.80^4.00^4.00^4.00^4.00^4.00^5.00^6.00^6.80^6.00 03MAY93 84MAY93 05MAY93 06MAY93 07MAY93 0811AY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 10MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 8.00^0.08^0.00^8.88^0.00^0.80^0.00^0.88^0.88^0.00^---^0.08^0.08^0.08^0.08^0.80^---6.00^6.00^6.00^6.00^6.00^6.00^6.88^6.00^6.08^6.80^6.88^6.00^6.80^6.00^6.80^6.80^6.88^6.80^6.08^6.80^6.00 0.00^0.00^0.00^8.00^0.08^0.00^0.80^0.80^0.00^0.00^----^0.80^8.00^0.00^0.00^0.00^---6.08^6.00^6.00^6.00^6.00^6.00^6.80^6.00^6.08^6.80^6.80^6.00^6.80^6.00^6.88^6.00^6.00^6.08^6.80^6.08^6.88 0.00^0.00^8.00^0.00^0.00^----^0.00^0.00^0.08^0.00^0.00^----^0.00^0.08^8.00^0.88^0.08^---6.80^6.08^6.00^6.00^6.80^6.00^6.80^6.80^6.00^6.00^6.80^6.08^6.88^6.00^6.08^6.80^6.00^6.00^6.80^6.08^6.00 24MAY93 2%1 1193 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01.11M3 82JUM93 03JUH93 84JUM93 0.80^0.08^0.88^0.80^0.00^----^0.00^0.08^8.80^0.80^8.00 6.80^6.08^6.00^6.80^6.08^6.00 6.00^6.08^6.00^6.88^6.00^6.00 0.00^0.80^0.08^0.80^0.80 ----^8.80^8.08^8.80^0.88^0.00 6.;1^6.rs^6.ss^6.00^6.00^6.80 6.00^6.88^6.00^6.80^6.80^6.00 0.08^0.00^8.00^0.88^0.00 ----^0.80^8.00^8.00^8.88^0.00 6.88^6.08^6.00^6.00^6.00^6. 6.08^6.00^6.00^6.80^6.;■^6.08 --  175  Appendix - G  176  EFD  Activity number & location ID*  Duration days  ESD  1 - A1  2  0  2  2 - A2  2  2  3 - B1  4  4 - A3  Leveled Schedule  FF  Start Date  Finish Date  0  0  2  4  0  2  4  2  6  0  4  6  2  4  6  0  10  12  5 - B2  4  6  10  0  2  6  6 - C1  6  6  12  0  6  10  7 - A4  2  6  8  6  12  16  8 - B3  4  10  14  0  16  20  9 - C2  6  12  18  0  6  12  10 - B4  4  14  18  6  12  18  11 - C3  6  18  24  0  18  24  12 - C4  6  24  30  0  24  30  ' Subscript 1,2,3 and 4 refer to the location number for the activity Early Start and Leveled Schedule - example 5.7  Project day  1  2  3  4  5  6  7  8  9  10  Resource aggregates before leveling  5  5  10  10  10  10  15  15  10  10  Resource aggregates after leveling  5  5  10  10  10  10  10  10  10  10  Project day  11  12  13  14  15  16  17  18  19  20  Resource aggregates before leveling  10  10  10  10  10  10  10  10  5  5  Resource aggregates after leveling  10  10  10  10  10  10  10  10  10  10  Project day  21  22  23  24  25  26  27  28  29  30  Resource aggregates before leveling  5  5  5  5  5  5  5  5  5  5  Resource aggregates after leveling  5  5  5  5  5  5  5  5  5  5  Daily Resource Aggregates before and after leveling - examp e 5.7  177  Appendix - H  178  Duration days  Resources  ESD  EFD  Activity number & location ID  Type  1 Start  Milestone  -  0  0  0  2- Al  Shadow  5  10  0  3- A2  Shadow  5  10  4- A3  Shadow  5  5- A4  Shadow  6- B 1  Leveled Schedule  FF  Start Date  Finish Date  0  0  0  5  0  0  5  0  5  4  0  5  10  0  5  8  12  17  5  10  0  5  12  5  10  Ordered  4  10  5  9  0  5  9  7- B2  Ordered  4  10  9  13  0  9  13  8- C 1  Ordered  6  10  9  15  0  9  15  9 - B3  Ordered  4  10  13  17  0  17  21  10 - C2  Ordered  6  10  15  21  0  15  21  11 - D 1  Continuous  4  10  17  21  0  25  29  12 - B4  Continuous  4  10  17  21  6  21  25  13 - C3  Ordered  6  10  21  27  0  21  27  14 - D4  Ordered  4  10  21  25  8  29  33  15 - C4  Ordered  6  10  27  33  0  27  33  16 Finish  Milestone  -  0  33  33  0  33  33  Subscript 1, 2, 3 and 4 refer to the location number for the activity Early Start and Leveled Schedule - example 5.8  179  1  2  3  4  5  6  7  8  9  10  11  Resource aggregates before leveling  40  40  40  40  40  10  10  10  10  20  20  Resource aggregates after leveling  20  20  20  20  20  20  20  20  20  30  20  Project day  12  13  14  15  16  17  18  19  20  21  22  Resource aggregates before leveling  20  20  20  20  20  20  30  30  30  30  20  Resource aggregates after leveling  20  30  20  20  20  20  20  20  20  20  20  Project day  23  24  25  26  27  28  29  30  31  32  33  Resource aggregates before leveling  20  20  20  10  10  10  10  10  10  10  10  Resource aggregates after leveling  20  20  20  20  20  20  20  20  20  20  20  Project day  Daily Resource Aggregates before and after leveling - example 5.8  •  180  Appendix - I  181  Duration days  Resource 1  ESD  EFD  Activity number & location ID  Type  1 Start  Milestone  -  0  0  0  2- A l  Shadow  5  10  0  3- A2  Shadow  5  10  4- A3  Shadow  5  5- A4  Shadow  6- B 1  Leveled Schedule  FF  Start Date  Finish Date  0  0  0  5  0  0  5  0  5  4  1  6  10  0  5  8  12  17  5  10  0  5  12  6  11  Ordered  4  8  5  9  0  5  9  7- B2  Ordered  4  8  9  13  0  9  13  8- C 1  Ordered  6  6  9  15  0  9  15  9 - B3  Ordered  4  8  13  17  0  17  21  10 - C2  Ordered  6  6  15  21  0  15  21  11 - D 1  Continuous  4  4  17  21  0  25  29  12 - B4  Continuous  4  8  17  21  6  21  25  13 - C3  Ordered  6  6  21  27  0  21  27  14 - D4  Ordered  4  4  21  25  8  29  33  15 - C 4  Ordered  6  6  27  33  0  27  33  16 Finish  Milestone  -  0  33  33  0  33  33  • Subscript 1, 2, 3 and 4 refer to the location number for the activity Early Start and Leveled Schedule: Resource 1 - example 5.9  182  Project day  1  2  3  4  5  6  7  8  9  10  11  Resource aggregates before leveling  10  20  20  20  20  18  18  18  18  16  16  Resource aggregates after leveling  10  20  20  20  20  18  18  18  18  24  24  Project day  12  13  14  15  16  17  18  19  20  21  22  Resource aggregates before leveling  14  24  24  24  16  16  14  14  14  14  14  Resource aggregates after leveling  14  24  16  16  16  16  14  14  14  14  14  Project day  23  24  25  26  27  28  29  30  31  32  33  Resource aggregates before leveling  14  14  14  10  10  10  10  10  10  10  10  Resource aggregates after leveling  14  14  14  10  10  10  10  10  10  10  10  .  Daily Resource Aggregates before and after leveling: Resource 1 - example 5.9  183  Duration days  Resource 2  ESD  EFD  Activity number & location ID  Type  1 Start  Milestone  -  0  0  0  2- A l  Shadow  5  4  0  3- A2  Shadow  5  4  4- A3  Shadow  5  5- A4  Shadow  6- B 1  Leveled Schedule  FF  Start Date  Finish Date  0  0  0  5  0  0  5  0  5  4  0  5  4  0  5  8  5  10  5  4  0  5  12  5  9  Ordered  4  6  5  9  0  10  14  7- B2  Ordered  4  6  9  13  0  14  18  8- C 1  Ordered  6  8  9  15  0  15  21  9 - B3  Ordered  4  6  13  17  0  17  21  10 - C2  Ordered  6  8  15  21  0  15  21  11 - D 1  Continuous  4  10  17  21  0  22  26  12 - B4  Continuous  4  6  17  21  6  18  22  13 - C3  Ordered  6  8  21  27  0  21  27  14 - D4  Ordered  4  10  21  25  8  26  30  15 - C4  Ordered  6  8  27  33  0  27  33  16 Finish  Milestone  -  0  33  33  0  33  33  • Subscript 1, 2, 3 and 4 refer to the location number for the activity Early Start and Leveled Schedule: Resource 2 - example 5.9  184  Project day  1  2  3  4  5  6  7  8  9  10  11  Resource aggregates before leveling  16  16  16  16  16  6  6  6  6  14  14  Resource aggregates after leveling  12  12  12  12  12  10  10  10  10  12  14  Project day  12  13  14  15  16  17  18  19  20  21  22  Resource aggregates before leveling  14  14  14  14  14  14  24  24  24  24  18  Resource aggregates after leveling  14  14  14  14  14  14  14  14  14  14  14  Project day  23  24  25  26  27  28  29  30  31  32  33  Resource aggregates before leveling  18  18  18  8  8  8  8  8  8  8  8  Resource aggregates after leveling  18  18  18  18  18  18  18  18  8  8  8  Daily Resource Aggregates before and after leveling: Resource 2 - example 5.9  185  Appendix - J  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCON TM  TEST PROJECT FOR THESIS - EXTENDED TEST 1 ^ Pred/Succ/Production File Used: D:\REPZ80\PROJ23\ASHONE  * Critical Activity Governing predecessor of an activity or successor governed by activity  Select: All Activities Sort:^Activity Code ACTIVITY CODE^DESCRIPTION  •^  DECESSORS ACT ACT. CODE^DESCRIPTION  *G80100  ACTIVITY A  PG80708  PROJECT START  *GOOZOO  ACTIVITY B  *400100  *G00300  ACTIVITY C  *G00400  I FS^8  ACTIVITY A  T  FS^0  *•G00208  ACTIVITY B  T  ACTIVITY D  *400308 G00600  ACTIVITY F  ACTIVITY C  G80500  ACTIVITY E  1K00100  G80600  ACTIVITY F  **G80200  *G00708  PROJECT START  *G081300  ACTIVITY G  FOR A TOTAL OF B ACTIVITIES  0080400 480580  Report Date:^27AP1193 Report Time:^15:29:51 Revision limber: 0 Progress Date:  •  SUCCESSORS TYPE PLOC REL LAG^OFF/LOC ACT. CODE^DESCRIPTION NT  Page 1 Of 1  TYPE SLOC DEL LAG^OFF/LOC  LOC_RANGEI PROD. DATA I WORK SKIP DUR  1  *400200 488500  ACTIVITY B ACTIVITY E  T NT  FS8 1 FS^0  ON 15  1- 15 1  0  3  0  N  *480308 +G80600  ACTIVITY C ACTIVITY F  T NT  FS^B 15 FS^0  ON 15  1- 15 1  0  4  FS^0  0  N  PG00400  ACTIVITY D  T  FSA  8N  1- 15 1  0  5  T NT  IS^8 15 FS^0  0  N 15  14+G00800  ACTIVITY G  T  ISO  ON  1- 15 1  B  7  ACTIVITY A  NT  15 FS^0  1  **G80000  ACTIVITY G  T  FF^0  0^N  1- 5 1  0  3  ACTIVITY B  NT  15 FS^0  15  * G00400  ACTIVITY D  NT  15 FS^0  15  15- 15 1  0  10  *+G00100  ACTIVITY A  NT  I FS^0  1  1 1  0  0  1- 15 1  0  4  ACTIVITY D  ACTIVITY E  T  T  FS^0 FF^0  0 0  N  1-  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON TM  TEST PROJECT FOR THESIS - EXTENDED TEST I  Page 1 Of 1  Resource & Production File Used: 0:\REPZ00\PROJ23\ASHONE Select: All Activities Sort:^Activity Code  ACTIVITY CODE^DESCRIPTION mG00100  mG00200  mG00380  mG88400  ACTIVITY A  ACTIVITY B  ACTIVITY C  ACTIVITY D  G00500  ACTIVITY E  G80600  ACTIVITY F  LOC_RANGEI PROD. DATA'RESOURCES ASSIGNED WORK SKIP DURIRES11 ABBREV DESCRIPTION 1- 15 1  1- 15 1  1- 15 1  1- 15 1  0  0  0  0  3  4  1  1  5  LAB  LAB  LAB  7  LAB  LABOURERS  LABOURERS  LABOURERS  LABOURERS  ACTIVITY RESOURCE USAGE LOC_RANGE^USAGE/UNITS  AVG. USAGE AMOUNT  DAY_RANGE^LEVEL  1  Z^Rate:  MEN/DAY  14.80  1  3  14.00  3  5 Rate:  MEN/DAY  12.00  1  3  12.00  6  10 Rate:  MEN/DAY  10.80  1  3  10.08  11  15 Rate:  MEN/DAY  8.80  1  3  8.00  1  3 Rate:  MEN/DAY  24.80  1  4  24.00  4  6 Rate:  MEN/DAY  21.88  1  4  21.08  7  9 Rate:  MEN/DAY  18.08  1  4  18.00  10  12 Rate:  MEN/DAY  15.88  1  4  15.00  13  15 Rate:  MEN/DAY  12.80  1  4  12.00  1  5 Rate:  MEN/DAY  30.80  1  5  30.00  6  10 Rate:  MEN/DAY  25.00  1  5  25.00  11  15 Rate:  MEN/DAY  20.00  1  5  20.00  1  5 Rate:  MEN/DAY  15.00  1  7  15.00  6  18 Rate:  MEN/DAY  10.08  1  7  18.00  11  15 Rate:  MEN/DAY  5.88  1  7  5.00  5 1  0  3  1  LAB  LABOURERS  1  5 Rate:  MEN/DAY  18.80  1  3  10.00  15- 15 1  0  10 1  LAB  LABOURERS  15  Rate:  MEN/DAY  5.00  1  10  5.00  LAB  LABOURERS  1  15 Rate:  MEN/DAY  3.00  1  4  3.00  1-  0000700  PROJECT START  1-  1 1  0  0  mG00800  ACTIVITY G  1- 15 1  0  4  FOR A TOTAL OF 8 ACTIVITIES  Report Date:^27APR93 Report Time:^15:31:28 Revision Number: 0 Progress Date:  m Critical Activity Governing predecessor of an activity or successor governed by activity  1  UBC CONSTRUCT ION MANAGEMENT LAB  ^  REPCON TM  TEST PROJECT FOR THES I S - EXTENDED TEST 1  RESOURCE USAGE REPORT  File Used: D:\REP200\PROJ23\ASHONE Report Period: 01MAR93 - 29JUN93 Selected Resources. All Project Activities.  •^  CLASS/SUBCLASS/RESOURCE Resource: LABOURERS Unit: MEN/DAY Usage: Rate Logistics: Used to level: No Weight:^1.00  Report Date: 27APR93 Report Time: 15:47:51 Progress Date: Revision Number: 0  ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative ES - Daily Cumulative LS - Daily Cumulative AL - Daily Cumulative  DAILY/CUMULATIVE RESOURCE USAGE  01MAR93 02MAR93 03MA1193 04MAR93 05MAR93 06MAR93 07MAR93 88MAR93 09MAR93 18MAR93 11MAR93 12MAR93 13MAR93 14MAR93 15MAR93 16MAR93 17MAR93 18MAR93 19MAR93 20MAR93 21MAR93 14.00^14.00^14.00^38.00^38.00^38.00^36.08^66.00^66.00^66.00^66.00^66.88^81.00^81.00^81.00^76.00^76.00^76.00^76.00^76.08^76.00 14.08^28.00^42.//^88.00^118.80^156.80^192.00^258.08^324.00^390.00^456.08^522.00^683.00^684.00^765.00^841.00^917.00^993.00 1069.00 1145.00 1221.00 14.00^14.00^14.00^24.00^24.00^24.00^24.08^44.80^44.00^44.00^54.00^54.00^39.80^39.00^57.00^57.08^57.88^69.00^69.00^39.88^39.00 14.08^28.00^42.80^66.00^98.00^114.00^138.00^182.00^226.80^278.00^324.80^378.00^417.00^456.00^513.00^570.00^627.00^696.00^765.08^884.00^843.80 14.80^14.08^14.00^38.00^38.08^38.00^36.08^66.00^66.00^66.00^66.00^66.00^69.00^69.00^69.00^78.00^78.08^78.00^76.00^76.00^76.00 14.80^28.80^42.08^80.00^118.00^156.00^192.80^258.80^324.00^390.80^456.08^522.00^591.08^660.00^729.00^807.00^885.00^963.80 1039.80 1115.00 1191.00 22MAR93 231141193 24MAR93 25MAR93 26MAR93 27MAR93 28MAR93 29MAR93 30MAR93 31MAR93 01APR93 02APR93 83APR93 84AP1193 05APR93 86APR93 07APR93 08APR93 09APR93 10APR93 11APR93 76.80^76.00^76.00^76.00^76.00^76.00^73.00^73.08^73.00^71.00^71.80^66.88^66.00^66.00^66.00^66.00^66.00^66.00^63.00^63.80^63.00 1297.00 1373.80 1449.00 1525.00 1681.00 1677.00 1750.08 1823.00 1896.08 1967.08 2038.88 2104.08 2170.08 2236.00 2382.00 2368.08 2434.88 2500.08 2563.00 2626.00 2689.00 57.80^57.00^57.00^66.00^66.80^36.00^36.00^57.00^57.00^57.08^66.08^66.80^36.00^36.00^55.00^55.00^55.00^66.80^66.00^36.00^36.80 980.00^957.80 1014.00 1880.00 1146.08 1182.00 1218.08 1275.88 1332.00 1389.00 1455.80 1521.00 1557.00 1593.00 1648.00 1703.80 1758.00 1824.00 1890.00 1926.00 1962.00 76.80^76.08^76.80^66.00^66.00^66.00^73.00^73.80^73.00^63.00^63.80^68.00^68.88^68.00^68.80^68.00^68.08^58.00^63.00^63.80^63.88 1267.00 1343.80 1419.00 1485.80 1551.08 1617.80 1690.08 1763.00 1836.00 1899.00 1962.80 2030.88 2098.08 2166.00 2234.00 2302.80 2370.00 2428.00 2491.00 2554.00 2617.00 12APR93 13APR93 14093 15093 16APR93 17APR93 18APR93 19APR93 28093 21APR93 22APR93 23APR93 24APR93 25APR93 26APR93 27APR93 28APR93 29APR93 30APR93 01MAY93 02MAY93 63.00^63.80^66.00^68.08^68.08^66.08^63.08^63.08^66.00^60.80^68.00^63.80^63.00^63.80^66.88^58.00^55.00^55.08^42.00^45.80^45.00 2752.00 2815.00 2881.80 2949.00 3017.00 3883.08 3146.00 3209.00 3275.00 3335.00 3395.00 3458.00 3521.80 3584.00 3650.00 3708.80 3763.08 3818.00 3860.00 3905.00 3950.80 50.00^58.00^50.80^58.00^58.00^28.00^28.80^45.08^45.00^45.80^53.00^53.00^28.00^28.00^45.00^45.00^45.00^53.00^53.80^28.08^28.08 2012.80 2062.00 2112.00 2170.00 2228.80 2256.00 2284.00 2329.00 2374.00 2419.00 2472.00 2525.00 2553.00 2581.00 2626.08 2671.08 2716.00 2769.00 2822.00 2850.00 2878.00 63.08^63.08^63.00^55.00^55.00^50.08^50.80^50.00^58.00^43.08^43.08^43.80^35.80^35.00^35.00^42.00^42.80^42.80^42.00^38.08^38.08 2680.00 2743.88 2806.08 2861.88 2916.00 2966.00 3016.00 3866.00 3116.08 3159.00 3282.00 3245.08 3280.00 3315.00 3350.00 3392.00 3434.00 3476.00 3518.00 3556.00 3594.00 03MAY93 84MAY93 05MAY93 06MAY93 07MAY93 08MAY93 09MAY93 10MAY93 11MAY93 12MAY93 13MAY93 14MAY93 15MAY93 16MAY93 17MAY93 18MAY93 19MAY93 20MAY93 21MAY93 22MAY93 23MAY93 ROO^38.80^35.00^35.08^35.00^38.08^38.00^38.80^38.00^35.00^30.80^38.00^33.80^33.08^33.00^33.00^30.00^30.00^30.00^8.08^8.08 3988.08 4026.00 4061.80 4096.88 4131.00 4169.00 4207.00 4245.00 4283.00 4318.00 4348.00 4378.00 4411.00 4444.00 4477.08 4510.00 4540.00 4570.08 4600.80 4608.00 4616.00 45.00^45.00^45.00^50.00^50.00^25.08^25.00^43.00^43.80^43.00^58.00^50.00^25.00^25.08^38.00^38.00^38.00^45.00^45.00^20.00^20.00 2923.00 2968.80 3013.88 3863.80 3113.08 3138.08 3163.80 3206.00 3249.00 3292.08 3342.00 3392.00 3417.00 3442.80 3480.00 3518.00 3556.00 3601.00 3646.00 3666.08 3686.08 38.00^30.00^38.80^38.00^30.00^30.00^30.00^30.00^30.80^22.00^22.00^22.00^22.00^18.00^18.00^18.08^10.00^20.00^20.00^18.00^10.00 3632.08 3662.00 3692.00 3722.00 3752.00 3782.00 3812.00 3842.00 3872.08 3894.80 3916.00 3938.08 3960.80 3978.08 3996.80 4014.00 4024.00 4044.80 4064.00 4082.00 4180.00 24MAY93 25MAY93 26MAY93 27MAY93 28MAY93 29MAY93 30MAY93 31MAY93 01,111193 02JUN93 03JUN93 04JUN93 05JUN93 06JUN93 87JUN93 08,1111193 89JUN93 10JUN93 11JUN93 12JUN93 13JUN93 8.08^8.00^5.80^5.80^5.00^8.00^8.80^8.00^8.00^5.00^5.00^5.00^8.00^8.00^8.80^8.00^5.00^5.00^5.80^8.00^8.00 4624.00 4632.00 4637.88 4642.00 4647.00 4655.00 4663.80 4671.00 4679.00 4684.08 4689.00 4694.00 4782.08 4718.00 4718.00 4726.00 4731.00 4736.00 4741.00 4749.00 4757.00 33.00^33.08^33.80^37.88^37.00^25.80^25.00^33.00^37.00^45.00^45.00^45.00^17.00^17.80^37.80^37.08^38.00^30.00^30.80^10.80^10.00 3719.00 3752.00 3785.08 3822.80 3859.00 3884.80 3989.00 3942.08 3979.00 4024.00 4069.00 4114.00 4131.08 4140.00 4185.80 4222.00 4252.08 4282.08 4312.00 4322.80 4332.00 18.00^18.08^27.00^27.00^27.08^17.80^16.00^19.80^19.00^19.08^13.00^38.00^30.80^30.80^30.08^30.80^15.08^15.08^15.00^25.00^25.08 4118.80 4136.80 4163.80 4190.00 4217.00 4234.80 4258.08 4269.08 4288.80 4307.08 4320.00 4358.80 4388.00 4418.00 4440.00 4470.00 4485.00 4500.00 4515.00 4540.80 4565.00 14JUN93 15JUN93 1611193 17JUN93 18JUN93 19JUN93 20JUN93 21JUN93 21111M93 23JUN93 24JUN93 25JUN93 26JUN93 27JUN93 28JUN93 29JUN93 8.08^8.00^5.08^5.00^5.00^8.80^8.00^8.00^8.00^5.06^5.00^5.80^3.00^3.08^3.00^3.08 4765.00 4773.80 4778.00 4783.00 4788.88 4796.08 4804.88 4812.80 4828.00 4025.00 4838.08 4835.00 4838.00 4841.08 4844.00 4847.80 30.00^40.00^48.88^48.00^48.08^15.00^15.00^15.00^15.80^15.00^15.08^15.80^55.08^55.80^55.08^55.00 4362.00 4402.00 4442.08 4482.08 4522.80 4537.08 4552.00 4567.08 4582.08 4597.08 4612.00 4627.00 4682.00 4737.08 4792.00 4847.80 25.00^25.00^28.00^14.88^14.00^28.00^20.88^14.00^14.00^18.00^15.80^15.00^15.08^15.00^15.08^15.08 4590.00 4615.80 4643.08 4657.88 4671.00 4691.08 4711.88 4725.00 4739.00 4757.00 4772.08 4787.08 4802.00 4817.00 4832.00 4847.00  ^ ^  REPCON TM  UBC CONSTRUCTION MANAGEMENT LAB SAMPLE HIGHR I SE PROJECT File Used: D:\REP208\PROJ11\SAMPLE Report Period: 81JUM88 - 31MAI189 Selected Resources. All Project Activities.  CLASS/SUBCLASS/RESOURCE ^  -  REVISED SCHEDULE VER 2 . 0  RESOURCE USAGE REPORT  Report Date: 28APR93 Report Time: 17:31:12 Progress Date: Revision Number: 8  DAILY/CUMULATIVE RESOURCE USAGE  Resource: labour^ 01JUN88 OZJUNI30 03JUN88 04JUN88 05JUN88 0611180 87JUN88 08JUN88 09JUN88 18JUN88 MUNN 12JUN88 13JUN80 14111180 15JUN88 16JUN88 17JUM08 18JUM80 19J01108 20J01188 21.14108 Usage: Rate^Unit: men/day^ES - Daily^----^ 4.00^4.06^4.08^4.08^4.88^5.00^5.00^4.00^4.08^4.88 ^ Logistics: Cumulative^ 4.00^8.00^12.00^12.80^12.00^16.08 20.00^25.80^30.08 34.88 34.00 34.08 38.80^42.08 Used to level: Yes Weight: 1.60 ^LS - Daily^ 4.80^4.88^4.08^4.00^4.08^2.00^2.00^2.00^5.00^5.00 Cumulative^ 4.00^8.08^12.00^12.08^12.00^16.08 20.86 '22.00^24.00 26.00 26.00 26.08 31.80^36.00 AL - Daily^ 4.08^4.08^4.08^----^4.00^4.00^5.00^5.00^4.00^4.08^4.00 Cumulative^ 4.00^8.08^12.00^12.80^12.00^16.00 20.80 25.08^30.08 34.80 34.00 34.08 38.80^42.00 2ZJUN38 23JUN88 24JUN813 25JUN88 26JUN88 27JUN88 28JUN88 29JUN88 30JUN88 01JUL88 02JUL88 03JUL80 04JUL88 05JUL80 86JUL88 07JUL88 08JUL88 09JUL88 10JUL83 11JUL88 12JUL88 ES - Daily^3.00^3.88^3.00^6.80^6.08^6.00^6.80^----^6.08^6.00^6.08^6.08^6.80^6.80^6.08 Cumulative^45.00 48.80^51.08 51.60^51.00 57.00 63.80^69.08^75.00^75.08^75.08^75.00^81.00 87.00^93.60^99.00 105.00 105.00 185.88 111.00 117.88 LS - Daily^3.00^3.08^3.00^----^3.00^3.00^6.08^6.00^ 6.00^6.08^6.88^8.80^8.00^0.00^6.80 Cumulative^39.80^42.80 45.08 45.80^45.08 48.00^51.00 57.08 63.80^63.68 63.80^63.00^69.88 75.08 81.00 89.00^97.00^97.08 97.08 105.00 111.00 AL - Daily^3.08^3.08^3.00^6.00^6.68^6.88^6.00^ 6.08^6.88^6.80^6.80^6.88^----^6.08^6.60 Cumulative ^45.00 48.08 51.08 51.68^51.08 57.00 63.88 69.80^75.00^75.00 75.00^75.00^81.60 87.08^93.08 99.00 105.00 185.86 105.08 111.08 117.00 13JUL88 14JUL88 15JUL88 16JUL88 17JUL88 18JUL88 19JUL88 20JUL88 21JUL88 22JUL88 23JUL88 24JUL88 25JUL88 26JUL88 27JUL88 28JUL88 29JUL88 30JUL88 31JUL88 01AUM8 02AUG88 ES - Daily^6.06^5.00^13.08^13.00^0.08^18.00^10.00^16.08^----^16.00^16.80^8.00^8.00^0.66^ 8.08 Cumulative^123.80 128.08 141.80 141.00 141.00 154.88 162.00 172.00 182.00 198.00 190.80 198.00 214.80 230.00 238.00 246.00 254.80 254.00 254.80 254.00 262.60 LS - Daily^6.00^5.88^13.80^13.00^11.80^13.08^10.80^16.08^16.00^16.68^8.88^8.80^8.00^ 8.00 Cumulative^117.00 122.00 135.00 135.00 135.00 148.88 159.00 172.00 182.00 198.08 198.80 198.80 214.08 230.08 238.80 246.00 254.00 254.80 254.00 254.00 262.00 AL - Daily^6.00^5.00^13.08^13.00^8.00^18.00^10.80^16.80^16.00^16.80^8.80^8.80^8.80^ 8.00 Cumulative ^123.80 128.00 141.80 141.80 141.80 154.08 162.88 172.80 182.88 198.00 198.88 198.80 214.80 230.00 238.88 246.00 254.00 254.00 254.86 254.08 262.80 03AUG88 84AUG88 05AUG88 06AUG88 07AUG88 08AUG88 09AUG88 10AUG88 11AUG88 12AUG88 13AUG88 14AUG88 15AUG88 16AUG88 17AUG88 18AUG88 19AUG88 28AUG80 21AUG88 22AUG88 23AUG88 ES - Daily^8.88^8.00^8.00^3.00^3.88^3.00^8.00^8.00^5.00^7.00^7.00^7.08^7.80^11.00^11.80 Cumulative^270.00 278.00 286.00 286.08 286.00 289.00 292.88 295.80 383.00 311.08 311.ss 311.08 316.08 323.00 330.08 337.00 344.00 344.00 344.88 355.80 366.80 LS - Daily^8.80^8.88^8.00^3.80^3.80^3.06^8.00^8.00^----^5.00^7.08^7.08^7.00^7.00^11.80^11.80 Cumulative^278.00 278.88 286.00 286.08 286.00 289.00 292.80 295.88 383.00 311.80 311.80 311.68 316.80 323.80 338.80 337.80 344.00 344.88 344.00 355.00 366.08 AL - Daily^8.00^8.08^8.80^3.00^3.08^3.00^8.08^8.80^5.00^7.80^7.00^7.88^7.00^---- 11.88^11.00 Cumulative^270.00 278.861 286.00 286.00 286.00 289.08 292.08 295.80 303.80 311.80 311.88 311.88 316.08 323.00 330.08 337.08 344.80 344.00 344.80 355.80 366.80 24AUG80 NUMB 26AUG88 27AUG88 28AUG88 29AUG88 30AUG88 31AUG88 01SEP88 82SEP88 03000 04SEP88 05SEP88 06SEP88 07088 08088 09SEP88 10SEP88 11088 12SEP88 13SEP88 ES - Daily^11.00^11.00^8.08^8.08^8.00^8.08^8.00^8.00^ 8.^8.00^16.88^24.80^----^16.00^15.00 Cumulative^377.88 388.08 396.80 396.08 396.80 484.00 412.00 420.80 428.60 436.00 436.68 436.80 436.00 444.00 452.00 468.80 492.88 492.00 492.00 508.00 523.80 LS - Daily^11.00^11.88^8.00^8.00^8.00^8.80^8.00^8.06^ 8.00^8.88^16.00^23.60^16.80^16.08 Cumulative^377.80 388.00 3%.88 396.00 396.88 484.08 412.60 420.00 428.88 436.88 436.88 436.80 436.00 444.00 452.08 468.00 491.00 491.00 491.00 587.08 523.00 AL - Daily^11.00^11.80^8.00^8.00^8.80^8.00^8.80^8.08^ 8.00^8.08^16.00^23.88^16.00^16.80 Cumulative ^377.80 388.00 396.00 396.00 396.80 404.00 412.68 420.00 428.80 436.00 436.08 436.80 436.00 444.08 452.00 468.00 491.88 491.08 491.00 507.00 523.00 14000 15SEP88 16088 17SEP88 18SEP88 19SEP88 20000 21080 22SEP88 23SEP88 24SEP88 25SEP88 26088 27SEP88 28088 29088 30SEP88 010CT88 02OCT88 030CT88 040CT88 ES - Daily^7.88^5.00^11.08^11.00^10.00^15.80^14.08^9.80^9.00^12.00^5.68^8.08^15.00^11.00^14.00 Cumulative^530.00 535.80 546.00 546.00 546.80 557.si 567.00 582.86 596.00 605.00 605.80 605.00 614.80 626.00 631.08 639.08 654.00 654.00 654.88 665.00 679.88 LS - Daily^7.80^5.80 11.80^11.00^10.00^14.08^15.08^7.08^----^7.00^18.00^3.88^6.88^13.80^7.08 10.00 Cumulative^538.80 535.08 546.80 546.88 546.80 557.00 567.00 581.^596.00 603.80 603.00 603.00 610.80 620.rs 623.00 629.80 642.08 642.08 642.00 649.00 659.80 AL - Daily^7.00^5.88^11.88^11.00^11.00^14.08^14.88^9.08^----^9.00^12.00^5.08^8.86^15.80^11.00^14.00 Cumulative^530.08 535.08 546.08 546.80 546.00 557.00 568.00 582.80 596.00 685.00 605.00 605.08 614.80 626.88 631.00 639.00 654.08 654.88 654.00 665.00 679.08 050CT88 060CT88 070CT88 080CT88 090CT88 100CT80 110CT88 120CT88 130CT88 140CT88 150CT88 160CT88 170CT88 100CT88 190CT80 200CT88 210CT08 220CT88 230CT88 240CT88 250CT88 ES - Daily^9J1^12.rs^19.08^----^---- 13.08^16.88^9.08^12.80^17.00^13.08^16.88^9.68^12.08^19.80^13.80 Cumulative^688.80 780.00 719.80 719.80 719.00 719.80 732.00 748.09 757.id 769.08 769.08 769.80 786.00 799.x4 815.88 824.00 836.00 836.00 836.80 855.00 868.80 LS - Daily^3.08^6.08^13.08^ 7.08^18.88^3.^6.08^13.00^7.1;^10.08^3.00^6.00^13.08^7.08 Cumulative^662.08 668.08 681.00 681.08 681.00 681.00 688.88 690.00 781.08 787.00 707.08 787.80 720.08 727.80 737.00 740.80 746.80 746.88 746.80 759.08 766.00 AL - Daily^9.00^12.08^19.88^ 13.08^16.00^9.00^12.80^17.00^13.54^16.08^9.00^12.00^19.00^13.08 Cumulative^680.88 708.08 719.^719.00 719.80 719.00 732.88 748.80 757.00 769.88 769.00 769.08 786.88 799.00 815.00 824.80 836.00 036.80 836.08 855.00 068.00 260CT88 270CT88 280CT88 290CT88 3000'08 310CT88 01M00J88 02110V138 03MOV08 04NOV88 0910908 06MO 1J88 07110V88 08NOV00 09MOV80 10H0V88 11H0V08 12110U88 13H0V08 141.10V88 15110V011 ES - Daily^16.86^9.00^12.88^19.00^13.88^16.00^9.08^12.00^19.80^13.80^16.80^9.00^ 12.00^19.88 Cumulative^884.00 893.80 985.00 905.00 905.08 924.68 937.88 953.00 962.00 974.00 974.00 974.80 993.68 1886.00 1022.80 1031.00 1031.00 1031.00 1031.08 1043.00 1062.00  ^  LS - Daily^18.00^5.00^0.08^15.80^9.00^12.00^5.08^8.08^15.80^9.08^14.00^7.08^ 10.00^17.00 Cumulative^776.88 781.00 709.08 789.00 789.80 884.00 013.00 825.88 830.08 838.08 038.80 838.00 853.00 862.00 076.88 003.08 803.80 803.00 883.08 893.88 910.00 AL - Daily^16.00^9.08^12.08^19.00^13.88^16.88^9.00^12.00^19.80^13.08 16.88^9.80^ 12.00^19.00 Cumulative^004.80 893.00 905.00 985.00 905.08 924.08 937.80 953.00 962.00 974.00 974.00 974.08 993.08 1006.88 1022.08 1031.00 1031.80 1031.00 1031.08 1043.00 1062.00 16NOUB8 17NOV88 MOVIE 19NOU88 20NOV88 21NOV08 22NOUBB 23HOU80 24N01108 25NOW8 26NOV88 27NOU88 MOM 29NOU88 38NOV80 81DEC88 02DEC80 03DEC88 04DECB0 05DEC88 06DEC88 ES - Daily^11.00^14.00^19.80^ 22.80 29.88 29.80 32.00 31.00^ 16.08 22.80 19.80^17.00^15.80^10.00^18.00 Cumulative 1873.00 1007.00 1186.80 1106.08 1186.80 1120.80 1157.00 1106.00 1210.08 1249.00 1249.00 1249.00 1265.08 1207.00 1306.00 1323.00 1338.80 1338.00 1338.00 1356.00 1374.00 LS - Daily^11.00^14.00^19.88^ 20.00 28.00 16.80^16.00^16.00^4.88^4.88^2.00^0.08^17.00^20.00^19.00 Cumulative^921.08 935.80 954.00 954.00 954.00 974.00 1002.00 1810.08 1034.08 1050.08 1058.00 1850.00 1054.88 1050.88 1060.88 1060.88 1885.80 1005.00 1005.00 1105.00 1124.80 AL - Daily^11.08^14.00^19.80^22.00^29.00^26.00 27.00 28.80^13.00^10.88^22.08^17.80^15.00^18.08^10.80 Cumulative^1873.00 1807.88 1106.00 1106.80 1106.80 1120.80 1157.00 1183.80 1210.80 1238.80 1238.00 1238.00 1251.00 1269.80 1291.00 1300.88 1323.00 1323.00 1323.80 1341.08 1359.80 87DECI313 WEBB 09008 10DEC88 11DEC88 12DEC88 13DECOB 14DEC88 15DEC88 16DEC88 17DEC88 MEMO 19DEC88 28DEC89 21DEC88 22DEC88 23DEC80 24DEC88 25DEC80 26DEC88 27DEC88 ES - Daily^21.08 13.80 15.00^ 27.00 27.80 27.80 30.00 35.00^35.00 35.00 33.00 33.00 27.80^ -Cumulative 1395.00 1488.00 1423.00 1423.00 1423.00 1458.00 1477.00 1504.80 1534.80 1569.08 1569.88 1569.08 1684.08 1639.80 1672.08 1785.88 1732.00 1732.00 1732.00 1732.00 1732.00 LS - Daily 16.00 21.00 21.00 22.88 25.08 25.00 27.80 20.00 34.00 32.08 32.00 35.00 32.00 -Cumulative 1140.00 1161.00 1182.00 11132.00 1182.80 1204.00 1229.00 1254.88 1281.00 1389.80 1309.00 1309.08 1343.00 1375.80 1407.80 1442.80 1474.00 1474.88 1474.00 1474.00 1474.00 AL - Daily 21.80 13.80 18.08 22.00 22.00 20.80 23.80 23.00 23.88 23.00 23.00 23.08 17.00 Cumulative^1380.08 1393.00 1403.00 1403.00 1403.00 1425.08 1447.00 1467.00 1490.00 1513.00 1513.08 1513.00 1536.08 1559.00 1582.88 1605.08 1622.00 1622.80 1622.00 1622.08 1622.88 20DEC88 29DEC88 30DEC88 31DEC88 01JANO9 02JAN139 03JANO9 04JAN09 05JANO9 06JANO9 07JAN89 08JAN89 09JAN89 10JAN89 MAO 12JAN89 13JAN89 14JAN89 15JANO9 16JAN89 1714109 ES - Daily 27.88 21.08 21.80 19.88 9.00 9.08 9.00 9.00 9.00 9.88 9.80 14.08 14.00 14.80 Cumulative 1759.80 1788.08 1001.80 1081.08 1801.08 1801.88 1820.08 1029.88 1830.08 1847.80 1847.00 1047.00 1856.00 1865.00 1074.00 1803.88 1897.00 1897.80 1097.00 1911.80 1925.00 LS - Daily 24.00 15.80 15.08 15.80 15.00 15.80 20.08 28.80 28.88 28.00 20.00 22.00 22.00 22.00 Cumulative 1498.80 1513.00 1520.00 1520.00 1520.00 1528.80 1543.80 1558.80 1573.00 1593.00 1593.00 1593.80 1613.00 1633.00 1653.00 1673.08 1695.08 1695.00 1695.08 1717.00 1739.00 AL - Daily 20.00 19.08 19.00 17.80 19.80 19.00 19.80 19.08 19.80 19.00 19.08 19.80 19.08 19.00 Cumulative ^1642.00 1661.00 1608.08 1680.00 1600.00 1600.08 1697.08 1716.80 1735.80 1754.88 1754.00 1754.00 1773.00 1792.08 1811.00 1038.00 1849.80 1849.00 1049.00 1060.80 1887.00 18JANO9 19JAN89 28JAN89 21JAM89 22JAN89 23JANB9 24JANB9 25JAN89 26JAN89 27JA1189 MAO 29JAN89 38JAN89 31JAN89 011E889 82FEB09 031E009 041009 05E889 06009 87FEBB9 ES - Daily^14.00^17.80 17.80^20.00 28.88 26.88 26.00 26.80^ 26.00 26.80 26.00 26.00 26.08^26.08 26.00 Cumulative 1939.80 1956.80 1973.08 1973.88 1973.00 1993.00 2013.08 2839.00 2865.80 2091.08 2891.00 2891.08 2117.00 2143.00 2169.00 2195.00 2221.00 2221.00 2221.00 2247.00 2273.00 LS - Daily 22.80 25.00 20.00 22.88 22.00 23.00 28.00 31.00 31.00 27.00 27.00 30.80 30.00 27.00 27.80 Cumulative 1761.08 1786.00 1806.80 1886.SS 1086.00 1820.00 1050.08 1073.08 1901.08 1932.00 1932.80 1932.08 1963.80 1990.00 2017.80 2047.88 2077.00 2877.00 2077.80 2184.08 2131.00 AL - Daily 19.08 19.08 19.08 18.00 18.88 19.88 19.08 19.08 19.80 19.80 22.00 22.00 22.80 19.00 19.80 Cumulative 1906.88 1925.00 1944.00 1944.00 1944.80 1962.08 1900.80 1999.80 2018.80 2037.00 2037.00 2837.80 2056.08 2075.00 2097.00 2119.80 2141.08 2141.08 2141.00 2160.00 2179.80 001089 09PE009 101E1309 11PE889 12FEB89 13FEB89 141E889 151E889 161E009 171E009 1131009 19FEB89 HEBB 211009 22FEB89 231E089 241E809 25FEB89 26FEB89 271E809 28FEB89 ES - Daily 24.80 24.08 21.88 21.00 21.00 21.00 21.00 21.88 21.88 22.80 19.00 19.00 19.88 19.00 19.80 Cumulative 2297.00 2321.00 2342.80 2342.00 2342.00 2363.88 2304.80 2485.00 2426.00 2447.08 2447.00 2447.00 2468.00 2498.08 2589.80 2528.08 2547.00 2547.00 2547.00 2566.00 2505.80 LS - Daily 27.88 27.00 27.00 27.00 24.08 24.00 23.80 23.00 28.88 28.00 21.00 21.08 21.80 21.80 21.00 Cumulative 2150.08 2185.00 2212.08 2212.80 2212.00 2239.08 2263.80 2207.08 2310.08 2333.08 2333.80 2333.08 2353.08 2373.00 2394.08 2415.08 2436.08 2436.80 2436.80 2457.00 2478.00 AL - Daily^19.00^19.80^19.00^ 19.88 19.80 19.00 23.00 20.08^20.00^20.00 21.08^21.88 21.00^21.00^21.08 Cumulative 2198.80 2217.00 2236.00 2236.08 2236.80 2255.88 2274.88 2293.08 2316.00 2336.00 2336.80 2336.00 2356.00 2376.08 2397.00 2410.08 2439.08 2439.00 2439.00 2468.00 2481.00 01MAR89 02MAR09 03HAR89 84MA809 05MAA09 06MAR89 07MAR89 MAW 09MAR89 10MA809 11M1109 12MAR89 13MAA09 14MAA139 15MAR89 16MAA09 17MAA89 10MAI109 19MAB89 2011A809 21MAI189 ES - Daily^19.00^19.80^19.^ 14.00^14.00^14.80^14.88^11.00^11.00^11.00^9.00^6.08^6.88^6.00^6.08 Cumulative 2684.08 2623.00 2642.00 2642.00 2642.00 2656.00 2670.00 2604.08 2698.08 2789.00 2709.00 2709.00 2720.80 2731.00 2748.00 2746.00 2752.00 2752.00 2752.00 2750.00 2764.00 LS - Daily 21.08 19.08 19.88 19.00 19.08 19.00 19.80 16.80 16.00 16.00 14.00 11.80 13.08 13.00 13.00 Cumulative 2499.00 2518.00 2537.80 2537.80 2537.08 2556.88 2575.08 2594.00 2613.00 2629.00 2629.00 2629.00 2645.00 2661.00 2675.00 2606.80 2699.00 2699.80 2699.80 2712.00 2725.00 AL - Daily 111.08 19.80 19.80 19.08 19.88 19.00 19.00 16.08 16.88 16.80 14.00 13.08 13.00 13.00 13.00 Cumulative 2499.80 2518.00 2537.08 2537.00 2537.00 2556.00 2575.00 2594.08 2613.08 2629.80 2629.08 2629.00 2645.00 2661.80 2675.08 2688.08 2701.88 2701.00 2781.00 2714.80 2727.00 22MAA09 23MAI109 24MAR89 25MAA09 26M0109 27MAA89 20MAA89 29MABB9 30MAA89 31MAI109 ES - Daily 6.80 6.80 6.88 3.00 3.80 2.00 Cumulative 2770.80 2776.80 2776.88 2776.00 2776.08 2776.00 2782.00 2785.08 2788.08 2790.00 LS - Daily 13.88 13.08 11.00 8.00 10.00 10.80 Cumulative 2730.08 2751.88 2751.08 2751.00 2751.80 2751.00 2762.80 2770.80 2700.88 2790.00 AL - Daily 13.00 11.00 11.00 18.00 10.00 8.00 Cumulative 2748.08 2751.08 2751.80 2751.00 2751.08 2751.80 2762.88 2772.00 2782.80 2790.80 ----  ----  ----  --^  ----  ----^  ----^  191  Appendix - K  ^  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCONTM  SAMPLE HIGHRISE PROJECT — REVISED SCHEDULE VER 2.0 File Used D:\REP200\PROJ11\SAMPLE  Page 2 Of 2  Early Start Time Dates  Report Date:^27APR93 ^ Report Time: 14:5L36 Progress Date: Revision Number: 0  LINEAR PLANNING CHART ACTIVITY INDEX Select: All Activities Sort*^Start Date Date Selection: Act/Sch/Early Schedule Window Time: 01JUN8B To 31MAR89 Locations* GPRJ To PNTH KEY^m Critical Activity^0 Activity has procurement sequence ^c Completed Code Type Description G01500 SM PROJECT START 0 G00200 0 OBTAIN DEMOLITION PERMIT  ^  Activity Types: 0 Ordered, C Continuous, S Shadow, H Hammock, SM Start Milestone, FM Finish Milestone  Code Type Description G01200^0 FORM & POUR B1 FLOOR SLAB 040500^0 REINFORCE 81 FLOOR SLAB  0 G00400 0 OBTAIN EXCAVATION PERMIT  0 040600 0 REINFORCE 81 WALLS 6 COLS  0 G00300 0 DEMOLISH EXISTING STRUCTURE  @ 001300 0 FORM 6 POUR Bt WALLS 6 COLS  w 50 G01600 FM DEMOLITION COMPLETE 020200^0 CLEAR SITE  up @ G00100 0 STRIP/FORM SS FLOOR SLABS  Code Type Description 160500^0 INSTALL ELECTRICAL ROOM mp@ 100100 C INSTALL PRECAST PANELS wp@ 110100 0 INSTALL WINDOWS 6 DOORS  8 160200 C ELECTRICAL ROUGH-IN  @ 120100 C INSTALL STEEL STUDDING  0 G02400 H SUPERSTRUCTURE SLABS  @ 040700 0 REINFORCE PLANTERS 6 WALLS  0 G00500 D MOBILIZE SITE  mp@ 040100 0 REINFORCE SS FLOOR SLABS  @ 001400 0 FORM 6 POUR PLANTERS/WALLS  O 160400 0 INSTALL TEMPORARY POWER 0 020100 C EXCAVATION  m @ 150500 0 MECH SLEEVING - SS FLOOR SLABS  0 090100 0 INSTALL ROOFING  xp @ 160100 0 ELECT SLVG/CONDUIT IN SS SLABS  @ G02100 FM ROOF COMPLETED  m 30 G02500^0 PLACE SLAB CONCRETE  @ 120200 C INSTALL DRYWALL  e  030100 C MESH, TIEBACKS 6 SHOTCRETE  @ 040200 0 REINFORCE FOUNDATIONS  0 G02200 0 FORM & PLACE SS WALLS 6 COLS  0 120300 S TAPE 6 FILL DRYWALL  @ G00600 0 FORM 6 POUR FOUNDATIONS  @ G02600 H SUPERSTRUCTURE WALLS 6 COLS  @ 090200 0 INSTALL WATERPROOF MEMBRANE  @ G00700 0 ERECT CRANE  @ 040800 0 REINFORCE SS WALLS & COLS  @ G01900 FM CRANE INSTALLED  @ 150400 0 MECH SLEEVING - SS WALLS & COL  @ G02700 H CRANE USAGE  0 160600 0 ELECT SLVG/CONDUIT - WALLS&COL  @ 040400 0 REINFORCE 82 WALLS & COLS  @ G02300 0 STRIP WALLS 6 COLS  @ G02000 FM CRANE DISMANTLED  w l7 G01000 0 FORM 6 POUR B2 WALLS & COLS  @ G01700 FM STRUCTURE FINISHED  0 150300 C FINISH VENT/SPRINKLER SYSTEM  0 G00900 0 BACKFILL FTGS 6 GRADE SOG  @ G02800 H SUPERSTRUCTURE  @ G011300 FM SUBSTANTIAL COMPLETION  CI  0 150200 0 ROUGH-IN VENTILATION SYSTEM  040300 0 REINFORCE SLAB ON GRADE  0 001100 0 FORM 6 POUR B2 SLAB ON GRADE Comment'  @ 150100 0 ROUGH-IN SPRINKLER SYSTEM  ep @ 160300 C ELECTRICAL FINISHING 0 050100 0 LANDSCAPING G00800 0 DISMANTLE CRANE  UBC CONSTRUCTION MANAGEMENT LAB ^  REPCONTM  SAMPLE HIGHRISE PROJECT — REVISED SCHEDULE VER 2.0 Late Start Time Dates  File Used D\REP200\PROJ11\SAMPLE  Page 2 Of 2 Report Date:^27APR93 Report Time:^14'56:30 Progress Date' Revision Number' 0  LINEAR PLANNING CHART ACTIVITY INDEX Select: All Activities Sort'^Start Date Date Selection: Act/Sch/Late Schedule Window Time: 01JUN88 To 31MAR89 Locations: GPRJ To PNTH  KEY^m Critical Activity^p Activity has procurement sequence^c Completed^Activity Types: 0 Ordered, C Continuous, S Shadow, H Hammock, SM Start Milestone, FM Finish Milestone Code Type Description G01500 SM PROJECT START  Code Type Description w 21 G01200^0 FORM & POUR B1 FLOOR SLAB  G00200^0 OBTAIN DEMOLITION PERMIT  w 22 040500^0 REINFORCE B1 FLOOR SLAB  0 G00300 0 DEMOLISH EXISTING STRUCTURE  0 040600 0 REINFORCE BI WALLS 6 COLS  0 G01600 FM DEMOLITION COMPLETE  @ G01300 0 FORM & POUR B1 WALLS & COLS  5O  ^0 OBTAIN EXCAVATION PERMIT  vp 0 G00100 0 STRIP/FORM SS FLOOR SLABS  G00500^0 MOBILIZE SITE  0 G02400 H SUPERSTRUCTURE SLABS  e  Code Type Description 0 ROUGH-IN SPRINKLER SYSTEM  0 100100  C INSTALL PRECAST PANELS  @ 160200 C ELECTRICAL ROUGH-IN P@ 110100  0 INSTALL WINDOWS S DOORS  @ 120100 C INSTALL STEEL STUDDING 0 090100  0 INSTALL ROOFING  0 020200 0 CLEAR SITE  xp® 040100 0 REINFORCE SS FLOOR SLABS  @ G02100 FM ROOF COMPLETED  ® 020100 C EXCAVATION  )9® 160100 0 ELECT SLUG/CONDUIT IN SS SLABS  @ 120200 C INSTALL DRYWALL  0 030100 C MESH, TIEBACKS S SHOTCRETE  m @ 150500 0 MECH SLEEVING - SS FLOOR SLABS  0 120300  e  S TAPE & FILL DRYWALL  0 G02500 0 PLACE SLAB CONCRETE  CI  @ 040200 D REINFORCE FOUNDATIONS  0 G02200 0 FORM & PLACE SS WALLS & COLS  0 040700  @ G00600 0 FORM & POUR FOUNDATIONS  @ G02600 H SUPERSTRUCTURE WALLS & COLS  @ 601400 0 FORM & POUR PLANTERS/WALLS  @ G00700 0 ERECT CRANE  0 040800 0 REINFORCE SS WALLS & COLS  @ 090200 0 INSTALL WATERPROOF MEMBRANE  0 G01900 FM CRANE INSTALLED  0 150400 0 MECH SLEEVING - SS WALLS S COL  @ 150300 C FINISH VENT/SPRINKLER SYSTEM  G02700 H CRANE USAGE  @ 160600 0 ELECT SLVG/CONDUIT - WALLS&COL  @ 050100 0 LANDSCAPING  CI  @ G00800 0 DISMANTLE CRANE  e  160400 0 INSTALL TEMPORARY POWER  0 040400 0 REINFORCE B2 WALLS & COLS  a  G02300 0 STRIP WALLS & COLS  160300 C ELECTRICAL FINISHING 0 REINFORCE PLANTERS & WALLS  @ G01000 0 FORM & POUR B2 WALLS & COLS  0 G01700 FM STRUCTURE FINISHED  @ G02000 FM CRANE DISMANTLED  0 G00900 0 BACKFILL FIGS S GRADE SOG  @ G02800 H SUPERSTRUCTURE  0 G01800 FM SUBSTANTIAL COMPLETION  @ 040300 0 REINFORCE SLAB ON GRADE G01100^0 FORM & POUR B2 SLAB ON GRADE Comment'  p @ 160500 0 INSTALL ELECTRICAL ROOM @ 150200 0 ROUGH-IN VENTILATION SYSTEM  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON M  SAMPLE HIGHRISE PROJECT - REVISED SCHEDULE VER 2.0 ^ pred/suec/product ion File used: O:\REP200\PROJ11\SAMPLE Select:^All Activities Sort:^Activity Code  ACTIVITY CODE^DESCRIPTION  * Critical Activity + Governing predecessor of an activity or successor governed by activity  Page 1 Of 5 28APR93 Report Date: Report Time: 16:51:20 Revision Number: 0 Progress Date:  PREDECESSORS SUCCESSORS LOC_RANGEI PROD. DATA ACT. CODE^DESCRIPTION^TYPE FLOC REL LAG^OFF/LOC I ACT. CODE^DESCRIPTION^TYPE SLOC REL LAG^OFF/LOC WORK SKIP DURI  *020100^EXCAVATION  028200^CLEAR SITE^NT^SW FS^B^131 G00480^OBTAIN EXCAVATION PERMIT ^NT^APPR FS^0^B1 00500^MOBILIZE SITE^NT^SW FS^0^111  +830100^MESH, TIEBACKS & SHOTCRETE ^FE 130100^MESH, TIEBACKS & SHOTCRETE ^SS * G80600^FORM & POUR FOUNDATIONS^NT^FDN FF *480680^FORM & POUR FOUNDATIONS^NT^FDN SS * 040280^REINFORCE FOUNDATIONS^NT^FDN FF *+040200^REINFORCE FOUNDATIONS^NT^FUN SS  0^N 0^ti FDN FDN FDN FDN  131-^81 1^0^7 B2-^B2 1^0^8 FDN- FDN 1^0^3  020280^CLEAR SITE  *+G08300^DEMOLISH EXISTING STRUCTURE^NT^SW FS^8^SW  +160400^INSTALL TEMPORARY POWER^NT^SW FS * 020100^EXCAVATION^NT^B1 FS  SW SW  SW-^SW 1^0^2  030100^MESH, TIEBACKS^SHOTCRETE  *+020100^EXCAVATION^T^SS^3^0^N *+020100^EXCAVATION^T^FF^3^0^N  * G00600^FORM & POUR FOUNDATIONS^NT^FDN FF * 040200^REINFORCE FOUNDATIONS^NT^FDN FF  B2 BZ  111-^B1 1^0^7 BZ-^82 1^0^8  *040100^REINFORCE SS FLOOR SLABS  *480100^STRIP/FORM SS FLOOR SLABS^T^SS^1^0^N *400100^STRIP/FORM SS FLOOR SLABS ^T^FF^0^0^N  *+G82500^PLACE SLAB CONCRETE ^ES +150200^ROUGH-IN VENTILATION SYSTEM ^FS 150100^ROUGH-IN SPRINKLER SYSTEM ^FS *+100100^INSTALL PRECAST PANELS^FS G81700^STRUCTURE FINISHED^NT^PNTH G01400^FORM & POUR PLANTERS/WALLS^NT^SW FS 090180^INSTALL ROOFING^NT^ROOF FS  0^II 3^N 3^N 5^N ROOF ROOF ROOF  *040200^REINFORCE FOUNDATIONS  *+020100^EXCAVATION^NT^FDN SS^1^FDN * 028100^EXCAVATION^NT^FDN FF^3^FDN 030100^MESH, TIEBACKS & SHOTCRETE^NT^BZ FF^3^FDN  *400708^ERECT CRANE^NT^SW SS 840400^REINFORCE 82 WALLS & COLS^NT^B2 FF x+040400^REINFORCE B2 WALLS & COLS^NT^BZ SS  FDN FDN FDN  FDN  1^0^8  *040300^REINFORCE SLAB ON GRADE  *480900^BACKFILL FIGS & GRADE SOG^NT^FDN FS^0^BZ  o G01200^FORM & POUR 01 FLOOR SLAB^NT^131 FS oG81100^FORM & POUR BZ SLAB ON GRADE ^NT^B2 FF *401100^FORM & POUR BZ SLAB ON GRADE ^NT^B2 SS  02 B2 B2  B2  1^0^2  *040400^REINFORCE BZ WALLS & COLS  *+040280^REINFORCE FOUNDATIONS ^NT^FDN 040200^REINFORCE FOUNDATIONS ^NT^FDN *+G80600^FORM & POUR FOUNDATIONS^NT^FDN * G00600^FORM & POUR FOUNDATIONS^NT^FDN *480780^ERECT CRANE^NT^SW  *+G80900^BACKFILL FIGS & GRADE SOG ^NT^FDN FS  82  BZ  1^0^10  *040500^REINFORCE 131 FLOOR SLAB  *+G01200^FORM & POUR 01 FLOOR SLAB^NT^81 SS^4^B1 *481200^FORM & POUR B1 FLOOR SLAB ^NT^B1 IF^0^B1  *+G81300^FORM & POUR 131 WALLS & COLS^NT^B1 FS^0^131 N.040600^REINFORCE B1 WALLS & COLS^NT^B1 FS^0^B1  B1  1^8^4  *040600^REINFORCE 01 WALLS & COLS  *+040500^REINFORCE B1 FLOOR SLAB ^NT^B1 IS^8^131 *41312^FORM & POUR B1 FLOOR SLAB^NT^B1 FS^0^111  *+G88100^STRIP/FORM SS FLOOR SLABS^NT^MAIN FF^2^131 * G00108^STRIP/FORM SS FLOOR SLABS ^NT^MAIN SS^5^B1  .G81400^FORM & POUR PLANTERS/WALLS^NT^SW SS^0^SW +G81480^FORM & POUR PLANTERS/WALLS^NT^SW FF^0^SW  13881380^DISMANTLE CRANE^NT^SW FS^0^SW 090200^INSTALL WATERPROOF MEMBRANE^NT^SW FS^0^SW  048700^REINFORCE PLANTERS & WALLS  SS^5^B2 FF^5^B2 SS^5^112 FF^5^BZ FS^0^B2  MAIN-MAIN 2- 2 3- 10 ROOF-ROOF  1^0^3 1^B^2 1^0^1 1^0^2  1^0^18 SW  1^0^15  ^  Page 2 Of 5  ACTIVITY CODE^DESCRIPTION  PREDECESSORS ACT. CODE DESCRIPTION  I  SUCCES^ ^ LOC_RANGEI PROD. D ATA I TYPE PLOC BEL LAG OFF/LOC ACT. CODESORS DESCRIPTION^TYPE SLOC REL LAG OFF/LOC^WORK SKI P DUR  *040800^REINFORCE SS WALLS & COLS  *+G02200^FORM & PLACE SS WALLS & COLS ^T 0G02200^FORM & PLACE SS WALLS & COLS^T  058100^LANDSCAPING  +090200^INSTALL WATERPROOF MEMBRANE ^NT^SW FS  SS B^B N FF B^0 N  SW  098180^INSTALL ROOFING  M  040100 * G00100 * 160100 *+G02308  REINFORCE SS FLOOR SLABS^NT ROOF STRIP/FORM SS FLOOR SLABS ^NT ROOF ELECT SLUG/CONDUIT IN SS SLABS NT ROOF STRIP WALLS & COLS^NT PNTH  FS FS FS FS  ROOF ROOF ROOF ROOF  090288^INSTALL WATERPROOF MEMBRANE  * 108100 090100 040700 601408 *418100  INSTALL PRECAST PANELS^NT MAIN FS INSTALL ROOFING^NT ROOF FS REINFORCE PLANTERS & WALLS ^NT^SW FS FORM 1 POUR PLANTERS/WALLS^NT^SW FS INSTALL WINDOWS & DOORS^NT MAIN FS  SW SW SW SW SW  *402300  N  STRIP WALLS & COLS  G81800^SUBSTANTIAL COMPLETION  128100^INSTALL STEEL STUDDING  *4100100^INSTALL PRECAST PANELS^T^FS  SW  1^0  20  Kr ROOF FS 8 NT^2 SS 5 Kr^SW FS 8  ROOF ROOF ROOF  ROOF  1^0  10  +850108^LANDSCAPING^NT^SW FS 0  SW  SW  T MT  ^2 N FS 0^1 N SW FS 0^MAIN  MAIN  NT NT  FS 0^8 N 2 FS B^10 SW FS B^MAIN  MAIN  +G82100 * 120280 090200  1 N^120100 *+120208 +890200  INSTALL PRECAST PANELS ROUGH-IN SPRINKLER SYSTEM ROUGH-IN VENTILATION SYSTEM INSTALL WINDOWS & DOORS  ROOF COMPLETED INSTALL DRYWALL INSTALL WATERPROOF MEMBRANE  *120288^INSTALL DRYWALL  128100 160280 898100 *+118100  INSTALL STEEL STUDDING ELECTRICAL ROUGH-IN INSTALL ROOFING INSTALL WINDOWS & DOORS  *120308^TAPE & FILL DRYWALL  *+120200  INSTALL DRYWALL  * G00100 * 040100 * 160100 +150200  STRIP/FORM SS FLOOR SLABS ^T REINFORCE SS FLOOR SLABS ELECT SLUG/CONDUIT IN SS SLABS T ROUGH-IN VENTILATION SYSTEM ^T  FS 0 FS 0 F'S 0 FS 0  3 3 3 0  N N N  150208^ROUGH-IN VENTILATION SYSTEM  *488100 *+048100 01 +160100  STRIP/FORM SS FLOOR SLABS ^T REINFORCE SS FLOOR SLABS ELECT SLUG/CONDUIT IN SS SLABS T  FS El FS 0 FS 0  3 3 3  N H N  150300 +150100 120100  158300^FINISH VENT/SPRINKLER SYSTEM  *+120380 150180 158208  TAPE & FILL DRYWALL ROUGH-IN SPRINKLER SYSTEM ^T ROUGH-IN VENTILATION SYSTEM ^T  ISO^ON FS 0^8 N FS 0^B N  GE1800  *150488^MECH SLEEVING - SS WALLS & COL **G82280 N+G112200  FORM & PLACE SS WALLS & COLS ^T FORM & PLACE SS WALLS 1 COLS ^T  SS 0^B N  INSTALL STEEL STUDDING INSTALL DRYWALL INSTALL WATERPROOF MEMBRANE  T^FS T^FS T^FS T^FS  0^ 2 N^+160200 ELECTRICAL ROUGH-IN 0^ 0 N * 120200 INSTALL DRYWALL 0 0 N 0 0 N  T^FS T^FS NT ROOF SS NT^1I3 FS  0^0 N P120380^TAPE & FILL DRYWALL 0^8 N^+GO0000^DISMANTLE CRANE 5^2 0  T  FF 0^8 N  H O^ON FS 0^8 N  T^FS 0 NT^SW FS B  T^FS 0^0 N *+160300^ELECTRICAL FINISHING +150300^FINISH VENT/SPRINKLER SYSTEM^T  N  2 2  SW  *+108100 158100 158200 * 110100  150188^ROUGH-IN SPRINKLER SYSTEM  MAIN 1^0 2 1^0 3- 10 1^8 PNTH 1^0  NT GPRJ FS 0  *100100^INSTALL PRECAST PANELS *+G80100 STRIP/FORM SS FLOOR SLABS ^T^ 5 N^+128100 FS INSTALL STEEL STUDDING ^FS CI *+840180 REINFORCE SS FLOOR SLABS^T^FS 5 N *+110108 INSTALL WINDOWS & DOORS *+160108 ELECT SLUG/CONDUIT IN SS SLABS T ^FS 5 N^090200 INSTALL WATERPROOF MEMBRANE *118100^INSTALL WINDOWS & DOORS  F'S 8^O N  150380^FINISH VENT/SPRINKLER SYSTEM^T 120188^INSTALL STEEL STUDDING  FINISH VENT/SPRINKLER SYSTEM^T ROUGH-IN SPRINKLER SYSTEM^T INSTALL STEEL STUDDING  2- 10 1^0 3 1^0 5  2- 10 1^0 3 1^0 6  2- 10 1^0^4  MAIN  1^0 6  0 N 5  2- 10 1^0^4 MAIN 1^0 7  FS 0^B N FS 0^0 N  Z- 10 1^0 B MAIN 1^0^II  FSO^ON FSO^ON  BZ- B1 1^0 7 MAIN 1^0 5 2- 18 1^0 4 PNTH 1^0 3  FS 0^0^ti FS 0^0 N FS 0^8 N  82- B1 1^B MAIN 1^0 6 2- 10 1^8 4 1^0 2 PNTH  SUBSTANTIAL COMPLETION^NT GPRJ FS 0  *+1112300^STRIP WALLS & COLS  1^8^10  MAIN  BZ- B1 1^0 2 2- 10 1^8 2 P NTH 1^0 2 MAIN 1^0 Z  T^BOON  MAIN 1^0 2 2- 10 1^0^1  Page^3 Of 5 ACTIVITY DESCRIPTION CODE  I ACT.. CODE  . CCES S ORS TYPE PLOC REL LAG^OFF/LOC I ACT . CODE DESCRIPTION  DESCRIPTION  TYPE SLOC REL LAG^OFF/LOC  LOC_RANGEI PROD. D ATA I WORK SKI P OUR 1^8  1  0^N  MAIN-MAIN 1^0 2-^18 1^0 ROOF-ROOF 1^0  2 1 1  0^N 3N 3^N 5^N ROOF ROOF  MAIN Z 3-^10 ROOF  1^8 3 102 1^0 1 1^0 2  0^N  B2-^81 2-^18 PATH MAIN  1^0 1^8 I^0 1^0  6 6 3 5  MAIN  BZ -^81 2-^10 PNTH MAIN  1^8 1^8 1^8 1^B  3 4 3 3  PATH *150500  MECH SLEEVING - SS FLOOR SLABS 10G80100 *+00180  STRIP/FORM SS FLOOR SLABS STRIP/FORM SS FLOOR SLABS  T^SS^1 I^FF^-1  8^N 8^N  *+02500  PLACE SLAB CONCRETE  *160100  ELECT SLUG/CONDUIT IN SS SLABS *+00100 *400100  STRIP/FORM SS FLOOR SLABS STRIP/FORM SS FLOOR SLABS  T^SS^1 T^FF^8  0^N 0^N  *+0Z500 +150200 150100 *+100100 01780 090100  PLACE SLAB CONCRETE ROUGH-IN VEHTILATION SYSTEM ROUGH-IN SPRINKLER SYSTEM INSTALL PRECAST PANELS STRUCTURE FINISHED INSTALL ROOFING  160280  ELECTRICAL ROUGH-IN  +128100  INSTALL STEEL STUDDING  T^FS^0  8^N  * 120280  INSTALL DRYWALL  *160300  ELECTRICAL FINISHING  *+120380 160500  TAPE & FILL DRYWALL INSTALL ELECTRICAL ROOM  T^FSO NT^BZ FS^0  ON 2  *+01800  SUBSTANTIAL COMPLETION  NT^GPRJ FS^B  160480  INSTALL TEMPORARY POWER  +020200 *480500 *+00508  CLEAR SITE MOBILIZE SITE MOBILIZE SITE  NT^SW FS^0 NT^SW SS^2 NT^SW FF^0  SW SW SW  * G00600  FORM & POUR FOUNDATIONS  NT  FDN ES^3  SW  SW  1^8  3  160508  INSTALL ELECTRICAL ROOM  * 08100  STRIP/FORM SS FLOOR SLABS  NT^3 FS^0  82  * 168388  ELECTRICAL FINISHING  NT  2 FS^8  82  BZ  1^8  38  T^SS^0 T^FF^0  0^H 8^N  *+02300  STRIP WALLS & COLS  T  FS^0  8^N  T^SS^0 T^FF^2 NT^81 SS^5 NT^B1 Fr^2 NT^BI SS^5 NT^81 FF^2  -1^N -1^H MAIN MAIN MAIN MAIN  +02800 *402500 +02400 *+150500 *+150508 *+160100 *+160100 +150208 150100 *+100100 *4048100 *+040100 01700 G01400 090100 160500  SUPERSTRUCTURE PLACE SLAB CONCRETE SUPERSTRUCTURE SLABS MECH SLEEVING - SS FLOOR SLABS MECH SLIDING - SS FLOOR SLABS ELECT SLUG/CONDUIT IN SS SLABS ELECT SLUG/CONDUIT IN SS SLABS ROUGH-IN VENTILATION SYSTEM ROUGH-IN SPRINKLER SYSTEM INSTALL PRECAST PANELS REINFORCE SS FLOOR SLABS REINFORCE SS FLOOR SLABS STRUCTURE FINISHED FORM & POUR PLANTERS/WALLS INSTALL ROOFING INSTALL ELECTRICAL ROOM  T SS^0 T FS^0 SS^8 T T FF^-1 T SS^1 T FF^0 T SS^1 T FS^0 T FS T FS^0 T FF^8 T SS^1 NT PNTH FS^8 NT SW FS^8 NT ROOF FS^5 82 FS^0 NT  ROOF ROOF ROOF 3  *+0300  DEMOLISH EXISTING STRUCTURE  NT  SW FS^0  *+00500 +020200  DEMOLITION COMPLETE MOBILIZE SITE CLEAR SITE  NT NT NT  * 020100  EXCAVATION  NT  *160688  ELECT SLUG/CONDUIT - WALLS&COL *+GOZZOO *.G02200  FORM & PLACE SS WALLS & COLS FORM & PLACE SS WALLS & COLS  *G00100  STRIP/FORM SS FLOOR SLABS  STRIP WALLS & COLS STRIP WALLS A COLS FORM & POUR B1 WALLS FORM & POUR 81 WALLS REINFORCE 81 WALLS & REINFORCE In WALLS &  002300 *402300 * 01300 *401380 * 840600 0040600  & COLS & COLS COLS COLS  *082  OBTAIN DEMOLITION PERMIT  0031500  PROJECT START  NT^GPRJ FS^0  *00300  DEMOLISH EXISTING STRUCTURE  *+G0020fl  OBTAIN DEMOLITION PERMIT  NT^APPR FS^8  OBTAIN EXCAVATION PERMIT  **G01500  PROJECT START  08488  NT^GPRJ PS^8  APPR  SW *401608 APPR  T  FS^8  T FS T FS T FS T FS NT PNTH FS NT ROOF FS T  FS  MAIN 1^0 2-^18 1^0 PATH 1^0  2 1 1  MAIN 2 3-^10 ROOF  1^0 1^0 1^0 1^8  4 3 2 4  APPR  APPR  1^0  5  SW FS^8 SW FS^0 SW FS^0  SW SW SW  SW  1^0  5  B1 FS^8  APPR  APPR  1^8  5  N N N N  N N N N N N N N  Page^4 Of^5 PREDECESSORS ACT. CODE DESCRIPTION^TYPE PLOC REL LAG^OFF/LOC  ACTIVITY DESCRIPTION CODE  SUCCESSORS ACT. CODE^DESCRIPTION  TYPE SLOG REL LAG^OFF/LOC  LOC_RANGEI PROD. DATA WORK SKIP DUBI  *G80500  MOBILIZE SITE  0030300  DEMOLISH EXISTING STRUCTURE^NT^SW ES^0^SW  +160400^INSTALL TEMPORARY POWER +160400^INSTALL TEMPORARY POWER *+020100^EXCAVATION  NT^SW FF^0^SW NT^SW SS^2^SW NT^Al FS^8^SW  SW  1^0^5  *G00608  FORM & POUR FOUNDATIONS  )0020180 * 020100 030100 160400  EXCAVATION^NT^ITN EXCAVATION^NT^FDN MESH, TIEBACKS & SHOTCRETE^NT^B2 INSTALL TEMPORARY POWER^NT^SW  * G01000^FORM & POUR 82 WALLS *401800^FORM & POUR 82 WALLS N+G00700^ERECT CRANE * 848488^REINFORCE B2 WALLS & *+040400^REINFORCE BZ WALLS &  NT^BZ FF^5^FUN NT^82 SS^5^FDN NT^SW SS^3^FDN NT^BZ FT^5^FDN NT^132 SS^5^FDN  FDN  1^0^8  ERECT CRANE  *+080600 *140200  FORM & POUR FOUNDATIONS^NT^FDN SS^3^SW REINFORCE FOUNDATIONS^NT^FDN SS^3^SW  DISMANTLE CRANE  0128200 G01480 040700 G02700  INSTALL DRYWALL^NT^5 FORM & POUR PLANTERS/WALLS ^NT^SW REINFORCE PLANTERS & WALLS ^NT^SW CRANE USAGE^NT^SW  *G00900  BACKFILL FIGS & GRADE SOG  *#040400 *+G01008  *G81000  FORM & POUR BZ WALLS & COLS  *G01188  FORM & POUR BZ SLAB ON GRADE  *G01280  FORM & POUR 131  *G81300 G81408  *G00780  G80800  SS^1^FEIN FF^1^FDN FF^4^FDN FS^3^FDN  & COLS & COLS COLS COLS  +G82700^CRANE USAGE *+G01900^CRANE INSTALLED *401008^FORM & POUR BZ WALLS & COLS *+040400^REINFORCE B2 WALLS & COLS  NT^SW NT^SW NT^BZ NT^BZ  SS^0^SW FS^0^SW FS^0^SW FS^0^SW  SW  1^0^2  +082000^CRANE DISMANTLED * G01800^SUBSTANTIAL COMPLETION  NT^SW FS^0^SW NT^GPRJ FS^0^SW  SW  1^0^2  REINFORCE B2 WALLS & COLS ^NT^132 FS^0^FDN FORM & POUR 82 WALLS & COLS ^NT^82 FS^0^FDN  *+040300^REINFORCE SLAB ON GRADE  NT^B2 FS^0^FDN  FUN  1^0^3  *+G013600 * 083608 *0;00700  FORM & POUR FOUNDATIONS^NT^FDN SS^5^B2 FORM & POUR FOUNDATIONS^NT^FDN FF^5^BZ ERECT CRANE^NT^SW FS^0^BZ  *+080900^BACKFILL FIGS 1 GRADE SOG  NT^FDN FS^0^BZ  BZ  1^0^10  *+840300 *+040300  REINFORCE SLAB ON GRADE ^NT^B2 SS^0^B2 REINFORCE SLAB ON GRADE ^NT^82 Fr^1^82  *+081280^FORM & POUR B1 FLOOR SLAB  NT^131 FS^0^02  112  1^0^3  *401100 * 040300  FORM & POUR BZ SLAB ON GRADE^NT^B2 FS^0^01 REINFORCE SLAB ON GRADE ^NT^BZ FS^0^81  *+G01380^FORM & POUR 111 WALLS & COLS PO40600^REINFORCE B1 WALLS & COLS *+048508^REINFORCE 01 FLOOR SLAB *+040500^REINFORCE B1 FLOOR SLAB  NT^Ill FS^0^81 NT^81 FS^0^Al NT^01 FF^0^01 NT^111 SS^4^B1  81  1^0^8  FORM & POUR 81 WALLS & COLS  *401200 *440500  FORM & POUR 81 FLOOR SLAB ^NT^B1 FS^0^81 REINFORCE 01 FLOOR SLAB^Hr^B1 FS^0^B1  *+008108^STRIP/FORM SS FLOOR SLABS * G00100^STRIP/FORM SS FLOOR SLABS  NT^MAIN FF^2^Al NT^MAIN SS^5^111  81  1^0^10  FORM & POUR PLANTERS/WALLS  N G88100 * 840180 *+G82300  STRIP/FORM SS FLOOR SLABS ^NT^ROOF FS^0^SW REINFORCE SS FLOOR SLABS^NT^HOOF FS^8^SW STRIP WALLS & COLS^NT^PNTH FS^0^SW  NT^SW NT^SW NT^SW NT^SW  FS^0^SW FS^0^SW FF^0^SW SS^0^SW  SW  1^0^15  NT^APPR FS^0^GPRJ NT^APPR FS^0^GPRJ  GPRJ  1^0^8  SW  1^0^0  FLOOR SLAB  FS^0^SW FS^8^S W FS^0^SW FF^0^S W  G88808^DISMANTLE CRANE 090200^INSTALL WATERPROOF METIBRANE +040700^REINFORCE PLANTERS & WALLS +040708^REINFORCE PLANTERS & WALLS  *G01500  PROJECT START  *G01680  DEMOLITION COMPLETE  *+000300  DEMOLISH EXISTING STRUCTURE ^NT^SW FS^0^SW  G81700  STRUCTURE FINISHED  * G80108 * 040180 * 168100 *402300  STRIP/FORM SS FLOOR SLABS ^NT^ROOF REINFORCE SS FLOOR SLABS^NT^ROOF ELECT SLUG/CONDUIT IN SS SLABS Kr ^ROOF STRIP WALLS & COLS^NT^PNTH  FS^0^PNTH FS^0^PNTH FS^8^PNTH FS^0^PNTH  PNTH  1^0^0  SUBSTANTIAL COMPLETION  *460380 G80800 058100  ELECTRICAL FINISHING^NT^MAIN FS^8^GPRJ DISMANTLE CRANE^NT^SW FS^0^GPRJ LANDSCAPING^NT^SW FS^0^GPRJ  GPRJ  1^0^8  *G01800  +G80400^OBTAIN EXCAVATION PERMIT *+008208^OBTAIN DEMOLITION PERMIT  VD  Page^5 Of 5 ACTIVITY CODE^DESCRIPTION  PREDECESSORS ACT. CODE DESCRIPTION 150308  TYPE PLOC REL LAG^OFF/LOC  SUCCESSORS ACT. CODE^DESCRIPTION  TYPE SLOC REL LAG^OFF/LOC  LOC_RANGEI PROD. DATA WORK SKIP DUDI  FINISH VENT/SPRINKLER SYSTEM  NT^MAIN FS^8^GPRJ  ERECT CRANE  NT  SW FS^8^SW  SW  1  8  8  *G81900  CRANE INSTALLED  m+680700  G82088  CRANE DISMANTLED  •G00800  DISMANTLE CRANE  NT  SW FS^0^SW  SW  1  8  0  G82100  ROOF COMPLETED  +098100  INSTALL ROOFING  NT^ROOF FS^0^ROOF  ROOF  1  8  8  PLACE SLAB CONCRETE PLACE SLAB CONCRETE  T^FS^0^8^N NT^ROOF FS^0^PNTH  MAIN-MAIN 2- 2 3- 10 PNTH-PNTH  1 1 1 1  8 0 0 8  3 2 1 4  -1^N -1^N Prfli PNTH PNTH  MAIN-^18 1 PNTH 1  0  1  0  1  FF  0^N  MAIN-ROOF 1  0  N/A  T^FS NT^PNTH FS  0^N ROOF  MAIN-ROOF 1  8  1  MAIM-^10 1 PNTH-PNTH 1  0 0  N/A N/A  1  0  N/A  2-^10 1  0  N/A  *G82280  *G82308  FORM & PLACE SS WALLS & COLS  STRIP WALLS & COLS  0G02500 0602500  x+682300 +G02600 *+840800 x+040880 0 150400 m+150400 x+160608 0160600  STRIP WALLS & COLS SUPERSTRUCTURE WALLS & COLS REINFORCE SS WALLS & COLS REINFORCE SS WALLS & COLS MECH SLEEVING - SS WALLS & COL MECH SLEEVING - SS WALLS & COL ELECT SLVG/CONRUIT - WALLS&COL ELECT SLVG/CONDUIT - WALLS&COL  G02000 0112200 0160608 0150400 •040800 682688  SUPERSTRUCTURE FORM & PLACE SS WALLS & COLS ELECT SLUG/CONDUIT - WALLS&COL MECH SLEEVING - SS WALLS & COL REINFORCE SS WALLS & COLS SUPERSTRUCTURE WALLS & COLS  T T T T T  FF FS FS FS FS PP  N N N N N  x+680100 x+600100 +G01700 +G81400 +090100  STRIP/FORM SS FLOOR SLABS STRIP/FORM SS FLOOR SLABS STRUCTURE FINISHED FORM & POUR PLANTERS/WALLS INSTALL ROOFING  G82480  SUPERSTRUCTURE SLABS  m+G08180  STRIP/FORM SS FLOOR SLABS  T  SS  N  0G02500  PLACE SLAB CONCRETE  *G82500  PLACE SLAB CONCRETE  m+608100 0160100 0158500 0040100 G82400  STRIP/FORM SS FLOOR SLABS T ELECT SLUG/CONDUIT IN SS SLABS T MECH SLEEVING - SS FLOOR SLABS T REINFORCE SS FLOOR SLABS SUPERSTRUCTURE SLABS  FS FS  FS  N N  *402200 x+682200  FORM & PLACE SS WALLS & COLS FORM & PLACE SS WALLS & COLS  SS  N  0682300  STRIP WALLS & COLS  NT  SW SS^8^SW  +G80880  T  SS^8^0^N  x+682300  G02600  SUPERSTRUCTURE WALLS & COLS  0682280  FORM & PLACE SS WALLS & COLS  602780  CRANE USAGE  m+G80700  ERECT CRANE  G82000  SUPERSTRUCTURE  0600100  STRIP/FORM SS FLOOR SLABS  FOR A TOTAL OF 58 ACTIVITIES  T  T T T T T T T T  FS SS FF SS FF SS FF SS  T FF T SS NT PNTH FS NT SW FS NT ROOF FS T  N N  FS FF  DISMANTLE CRANE STRIP WALLS & COLS  T  FP^8  0^N  HT  SW FF^8  SW  T  FF^0  0^N  SW  ^  UBC CONSTRUCTION MANAGEMENT LAB  ^  REPCON TM  SAMPLE HIGHRISE PROJECT - REVISED SCHEDULE VER 2.0 Page 10f 4  product ion/resources File Used: D:\REPZEIO\PROJIl\SAMPLE  * Critical Activity •Governing predecessor of an activity  Select: All Activities Sort:^Activity Code  ACTIVITY CODE^DESCRIPTION x020100^EXCAVATION  Report Date:^28APR93 Report Time:^17:07:12 Revision Number: 0 Progress Date:  4  or successor governed by activity  •^ LOC_RANGEI PROD. DATA'RESOURCES ASSIGNED WORK SKIP DURIRES1 ABBREV DESCRIPTION Bl- 111 1 B2- R2 1 FDN- FUN 1  0 0 0  7^1 13 3  labour labour  ACTIVITY RESOURCE USAGE LOC_RANGE USAGE/UNITS  AUG. USAGE AMOUNT DAY_RANGE LEVEL I  81  B1^Rate:  men/day  3.08  1  7  3.80  BZ  B2^Rate:  men/day  3.80  1  B  3.08  FDN^FUN^Rate:  men/day  2.00  1  3  2.00  020208^CLEAR SITE  SW-^SW 1  0  Z^1  labour labour  SW  SW^Rate:  men/day  3.08  1  2  3.00  030180^MESH, TIEBACKS & SHOTCRETE  81- 81 1 B2- 82 1  0 0  7^1 8  labour labour  B1  131^Rate:  men/day  3.00  1  7  3.00  02  82^Rate:  men/day  3.00  1  8  3.00  MAIN MAIN^Rate:  men/day  5.80  1  3  5.00  2  5.80  *040100^REINFORCE SS FLOOR SLABS  *040200^REINFORCE FOUNDATIONS  MAIN-MAIN 2- 2 3- 18 ROOF-ROOF  1 1 1 1  0 8 0 0  3^1 2 1 2  labour labour  2  2^Rate:  men/day  5.00  1  3  10^Rate:  men/day  4.80  1  ROOF  Rate:  men/day  3.00  1  2  3.80  4.08  FDN  1  0  8^1  labour labour  FDN  Rate:  men/day  3.08  1  8  3.00  *040308^REINFORCE SLAB ON GRADE  BZ  1  0  2^1  labour labour  B2  Rate:  men/day  3.80  1  2  3.88  *040400^REINFORCE BZ WALLS & COLS  B2  1  0  10^1  labour labour  82  Rate:  men/day  3.00  1  10  3.00  *840500^REINFORCE B1 FLOOR SLAB  01  1  0  4^1  labour labour  01  Rate:  men/day  4.00  1  4  4.80  *048600^REINFORCE 81 WALLS & COLS  B1  1  0  10^1  labour labour  81  Rate:  men/day  3.00  1  10  3.00  SW  1  0  15^1  labour labour  SW  Rate:  men/day  2.00  1  15  2.00  MAIN I 2 1 3- 10 1 PNTH 1  0 0 8 0  Z^1 2 1 2  labour labour  MAIN  Rate:  men/day  3.00  1  2  3.00  2  Rate:  men/day  3.80  1  2  3.08  3  10^Rate:  men/day  3.08  1  PNTH  Rate:  men/day  3.08  1  Z  3.88  040700^REINFORCE PLANTERS & WALLS *040800^REINFORCE SS WALLS & COLS  050108^LANDSCAPING 098100^INSTALL ROOFING  3.80  SW  1  0  20^1  labour labour  SW  Rate:  men/day  5.08  1  20  5.80  ROOF  1  0  10^1  labour labour  ROOF  Rate:  men/day  5.08  1  18  5.08  Page^2 Of^4 ACTIVITY CODE^DESCRIPTION 890200 *100180  *110180  120100  *120208  *120300  158100  150280  150300  N150400  *150500  INSTALL WATERPROOF MEMBRANE INSTALL PRECAST PANELS  INSTALL WINDOWS & DOORS  INSTALL STEEL STUDDING  INSTALL DRYWALL  TAPE & FILL DRYWALL  ROUGH-IN SPRINKLER SYSTEM  ROUGH-IN VENTILATION SYSTEM  FINISH VENT/SPRINKLER SYSTEM  LOC_RANGEI PROD. DATA (RESOURCES ASSIGNED WORK SKIP DURIRESI ARROW DESCRIPTION  ACTIVITY RESOURCE USAGE LOC_RANGE^USAGE/UNITS  AVG. USAGE AMOUNT  DAY_RANGE^LEVEL  1  0  10 1  labour labour  SW^Rate:  men/day  4.00  1  10  4.00  2-^10 1 MAIN 1  0 0  3 5  labour labour  2^10^Rate:  men/day  6.00  1  3  6.80  MAIM^Rate:  men/day  6.00  1  5  6.00  2^10^Rate:  men/day  3.00  1  3  3.00  MAIN^Rate:  men/day  3.00  1  6  3.00  2^10^Rate:  men/day  3.00  1  4  3.00  MAIN^Rate:  men/day  3.00  1  6  3.00  2^10^Rate:  men/day  5.80  1  4  5.08  MAIN^Rate:  men/day  5.00  1  7  5.00  Z^10^Rate:  men/day  3.00  1  8  3.00  MAIN^Rate:  men/day  3.00  1  8  3.00  BZ^81^Rate:  men/day  2.00  1  7  2.00  MAIN^Rate:  men/day  2.80  1  5  2.00  2^10^Rate:  men/day  2.00  1  4  2.80  PNTH^Rate:  men/day  2.00  1  3  2.08  BZ^01^Rate:  men/day  2.88  1  8  2.00  MAIN^Rate:  men/day  2.00  1  6  2.00  2^10^Rate:  men/day  2.00  1  4  2.00  PNTH^Rate:  men/day  2.00  1  2  2.00  BZ^81^Rate:  men/day  1.00  1  2  1.08  2^10^Rate:  men/day  1.00  1  2  1.00  PNTH^Rate:  men/day  1.00  1  2  1.00  MAIN^Rate:  men/day  1.80  1  2  1.00  MAIN^Rate:  men/day  1.00  1  2  1.00  2^10^Rate:  men/day  1.00  1  1.00  PNTH^Rate:  men/day  1.80  1  1.00  MAIN MAIN^Rate:  men/day  1.00  1  2^10^Rate:  men/day  1.00  1  SW  2-^18 1 MAIN 1 2-^10 1 MAIN 1 2-^10 1 MAIN 1 2-^18 1 1 MAIN BZ-^B1 MAIM 2-^10 PNTH  B2-^B1 MAIN 2-^10 PNTH  B2-^111 2-^10 PNTH MAIN  1 1 1 1  1 1 1 1  1 1 1 1  MECH SLEEVING - SS WALLS & COL MAIN  1 2-^18 1 MTH 1  MECH SLEEVING - SS FLOOR SLABS MAIN-MAIN 1 2-^18 1 ROOF-ROOF 1  0 0 0 0 0 0 0 0  0 0 0 0  0 8 0 0  0 0 0 0  0 0 8  0 0 0  3 6 4 6 4 7 B II  7 5 4 3  8 6 4 2  2 2 2 Z  2 1 1  1 1  1  1  1  1  1  1  1  1  1  labour labour  labour labour  labour labour  labour labour  labour labour  labour labour  labour labour  labour labour  labour labour  2  1. ■^ 1.00 O  ^  Page^3 Of^4 ACTIVITY CODE^DESCRIPTION  LOC_RANGE PROD. DATA RESOURCES ASSIGNED WORK SKIP DURIRES1 ABBREV DESCRIPTION  *160100^ELECT SLUG/CONDUIT IN SS SLABS MAIN 1^0 3 2 1^0 2 3- 10 1^0^1 ROOF 1^0 2  160200^ELECTRICAL ROUGH-IN  *160300^ELECTRICAL FINISHING  B2- 81 1^0 6 2- 18 1^0^6 PNTH 1^0 3 MAIN 1^0 5  02- 81 2- 10 PNTH MAIN  1^0 1^0 1^8 1^0  3 4 3 3  1^labour labour  1^labour labour  1^labour labour  ACTIVITY RESOURCE USAGE LOC_1101GE^USAGE/UNITS  AUG. USAGE AMOUNT  DAY_RANGE^LEVEL  ROOF ROOF^Rate:  men/day  1.00  1  MAIN^Rate:  men/day  2.08  1  3  2.00  2^Rate:  men/day  2.00  1  2  2.80  3^10^Rate:  men/day  2.80  1  ROOF^Rate:  men/day  2.00  1  2  2.08  B2^81^Rate:  men/day  3.00  1  6  3.00  2^18^Rate:  men/day  3.08  1  6  3.88  PNTH^Rate:  men/day  3.00  1  3  3.08  MAIN^Rate:  men/day  3.08  1  5  3.00  B2^111^Rate:  men/day  2.00  1  3  2.00  2^10^Rate:  men/day  2.00  1  4  2.00  PNTH^Rate:  men/day  2.00  1  3  2.88  MAIN^Rate:  men/day  2.80  1  3  2.80  1.00  2.08  160400^INSTALL TEMPORARY POWER  SW  1^0 3  1^labour labour  SW^Rate:  men/day  2.00  1  3  2.00  160500^INSTALL ELECTRICAL ROOM  B2  1^8 30 1^labour labour  B2^Rate:  men/day  LOA  1  38  2.00  MAIN^Rate:  men/day  2.08  1  2  2.88  2^10^Rate:  men/day  2.80  1  2.00  PNTH^Rate:  men/day  2.08  1  2.80  MAIN^Rate:  men/day  8.00  1  4  8.08  2^Rate:  men/day  7.80  1  3  7.80  3^10^Rate:  men/day  6.08  1  2  6.80  ROOF^Rate:  men/day  6.00  1  4  6.00  SW^Rate:  men/day  4.00  1  5  4.08  SW^1^8 5^1^labour labour  SW^Rate:  men/day  2.00  1  5  2.00  FDN^1^0 0 1^labour labour  FDN^Rate:  men/day  5.08  1  8  5.08  SW^1^8 2 1^labour labour  SW^Rate:  men/day  2.00  1  2  2.08  SW^1^0 2 1^labour labour  SW^Rate:  men/day  2.80  1  2  2.00  *160600^ELECT SLUG/CONDUIT - WALLS&COL MAIN 1^0 2 2- 18 1^8 1 PNTH 1^0 1  *G00180^STRIP/FORM SS FLOOR SLABS  *G00200^OBTAIN DEMOLITION PERMIT *G00300^DEMOLISH EXISTING STRUCTURE G00488^OBTAIN EXCAVATION PERMIT *G00500^MOBILIZE SITE *G00600^FORM & POUR FOUNDATIONS *G00700^ERECT CRAKE GMBH^DISMANTLE CRANE  MAIN 1^0 2 1^0 3- 10 1^0 ROOF 1^0  4 3 Z 4  1^labour labour  1^labour labour  APPR^1^0 5 SW^1^0 5 1^labour labour APPR^1^0 5  t•-.) O  Page 4 Of 4 ACTIVITY CODE^DESCRIPTION NG00900^BACKFILL FIGS & GRADE SOG  LOC_RANGE1 PROD. DATA 'RESOURCES ASSIGNED IlOORN SKIP DURIRES11 ABM DESCRIPTION  ACTIVITY RESOURCE USAGE LOC_RANGE USAGE/UNITS  AVG. USAGE AMOUNT DAY_RANGE LEVEL  FDN  1  0  3^1  labour labour  FDN^Rate:  men/day  3.00  1  3  3.80  *G01000^FORM & POUR 82 WALLS & COLS  B2  1  0  10^1  labour labour  B2^Rate:  men/day  5.00  1  10  5.00  *G81100^FORM & POUR 82 SLAB ON GRADE  B2  1  0  3^1  labour labour  BZ^Rate:  men/day  5.00  1  3  5.00  *G81200^FORM & POUR Al FLOOR SLAB  B1  1  0  8^1  labour labour  B1^Rate:  men/day  7.00  1  8  7.08  *G81308^FORM & POUR Al WALLS & COLS  81  1  0  10^1  labour labour  B1^Rate:  men/day  5.00  1  10  5.00  G81400^FOAM & POUR PLANTERS/WALLS  SW  1  8  15^1  labour labour  SW^Rate:  men/day  3.88  1  15  3.00  GPRJ  1  0  0  SW  1  0  0  PNTH  1  0  0  GPRJ  1  0  0  SW  1  0  0  SW  1  0  8  ROOF  1  0  0  MAIN-MAIN 2- 2 3- 10 PNTH-PNTH  1 1 1 1  0 0 A 0  3^1 2 1 4  labour labour  MAIN MAIN^Rate:  men/day  5.00  1  3  5.00  2^2^Rate:  men/day  4.08  1  2  4.80  3^10^Rate:  men/day  4.00  1  PNTH PNTH^Rate:  men/day  5.00  1  MAIN^10^Rate:  men/day  3.00  1  3.00  PNTH^Rate:  men/day  3.00  1  3.00  MAIN ROOF^Rate:  men/day  7.00  1  7.00  C01508^PROJECT START *G01680^DLrOLITION COMPLETE G01780^STRUCTURE FINISHED *G01800^SUBSTANTIAL COMPLETION *G01900^CRANE INSTALLED G82000^CRANE DISMANTLED G02100^ROOF COMPLETED *G02208^FOAM & PLACE SS WALLS & COLS  C112300^STRIP WALLS & COLS  G02400^SUPERSTRUCTURE SLABS *G02500^PLACE SLAB CONCRETE G02600^SUPERSTRUCTURE WALLS & COLS G02700^CRANE USAGE G02800^SUPERSTRUCTURE FOR A TOTAL OF 58 ACTIVITIES  MAIM-^10 1 PNTH 1  0 0  1^1 1  MAIN-ROOF 1  0  N/A  MAIN-ROOF 1  8  1^1  MAIN-^10 1 PNTH-PNTH 1  0 0  N/A N/A  1  0  N/A  2-^10 1  0  N/A  SW  labour labour  labour labour  4.00 4  5.00  

Cite

Citation Scheme:

        

Citations by CSL (citeproc-js)

Usage Statistics

Share

Embed

Customize your widget with the following options, then copy and paste the code below into the HTML of your page to embed this item in your website.
                        
                            <div id="ubcOpenCollectionsWidgetDisplay">
                            <script id="ubcOpenCollectionsWidget"
                            src="{[{embed.src}]}"
                            data-item="{[{embed.item}]}"
                            data-collection="{[{embed.collection}]}"
                            data-metadata="{[{embed.showMetadata}]}"
                            data-width="{[{embed.width}]}"
                            async >
                            </script>
                            </div>
                        
                    
IIIF logo Our image viewer uses the IIIF 2.0 standard. To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.831.1-0050448/manifest

Comment

Related Items