Project Management With CPM And PERT 2nd Edition Joseph J. Moder, Cecil R. Phillips - Solutions

Discover the ultimate resource for mastering "Project Management With CPM And PERT 2nd Edition" by Joseph J. Moder and Cecil R. Phillips. Access a comprehensive answers key and solutions manual online, featuring step-by-step answers and solved problems that ensure a thorough understanding. Our solutions PDF and test bank provide the chapter solutions and questions and answers you need for success. Enhance your learning experience with the instructor manual and textbook materials, all available for free download. Perfect for students seeking detailed insights and efficient study tools in project management.

Using the network of the survey project in Figure 11-3, update the project schedule with the following progress as of the end of day 8:Actual Actual Activity Start Date Finish Date Change 1-2 1 3 2- 4 3 Change time estimate to 8 days.2-3 5 No change in time estimate.4-6 Change time estimate to 8
Consider drawing a GERT network for an embellishment of Problem 5. Suppose there are 4 projects and two research teams. Team 1 is to start on project 1, and team 2 on project 4. When a team completes a project (for any reason), it immediately moves on to a project that has not yet started. Team 1
Draw a GERT network for a general R&D process which includes the following activities or nodes: start project; problem definition; research activity;evaluate solutions; solution unacceptable more research; solution unacceptable redefine problem; project washout; develop prototype; redevelop
Draw a GERT network for the following procedure used by a university patent committee.1, Inventor submits invention to patent committee.
The techniques of resource allocation (Chapter 7) are applicable to certain types of job-shop scheduling problems, especially where the sequence of jobs is fixed and the problems are reduced to questions of the loading of certain facilities or pools of resources and the avoidance of project (or
Compare the results of your scoring in the exercise above with those of other students and, if practical, with the opinions of persons experienced with a variety of networking schemes. As a result of these comparisons, comment on whether it is practical to evaluate networking schemes on a
Construct a table containing a list of criteria that you feel could be used to measure the utility of networking schemes. On the other axis list all the networking and project charting schemes you are familiar with, including hybrid forms of bar charts, milestone charts: or others. Then assign a
How would PERT be applied to precedence diagramming? Answer this question by applying the Central Limit Theorem.a. Describe a procedure that could be used assuming the critical path is specified as suggested in Chapter 4. For example, the network in Figure 4-1 If has the following critical path.
Apply the PNET procedure to the network shown in Figures 9-12 and 9-13.a. Compute the corrected probability of meeting the schedule of 12/13/61 for event 4199. (This is equivalent to a project duration of 27.0 weeks).b. Compute the cumulative probability curve for a range of scheduled times from 26
Referring to exercise 2 in Chapter 8 assume the times given under a and b are 0 and 100 percentiles, so that the standard deviation, (vt)'I2 = (b - a)/6, and the times under the m column are single time estimates of the mean, i.e., t, = m, in this case. Without making a complete PERT statistical
Repeat exercise 7 for the network given in Figure 9-1 making the same assumptions as suggested in exercise 7 about the distributions of activity performance times. To carry out this exercise, use the following values ofa, m, and b.
Solve exercise 3 using the Monte Carlo approach described in the text. For simplicity, assume that the distribution of perfoqnance times for each activity is rectangular between the limits given by a andb. Using a table of random numbers that are uniformly distributed on the range from 0 to 1,
Repeat exercise 5 on the assumption that event 7 has occurred 2 days late, i.e., at the end of the 12th day.
With reference to Figure 9-1, what is the (conditional) probability that event 8 will be completed on or before the end of the 16th day, assuming that a scheduled time of 10 is met on event 7?
With reference to Figure 9-1, what is the probability that event 8 will be completed on or before the end of the 12th day, assuming all activities are started as early as possible? What scheduled time for the entire project would you feel 95 percent confident of meeting without having to expedite
Consider the oversimplified network given in Figure 9-20 which might be only a portion of a larger network, a portion which is subject to considerable chance variation in the performance times. In Figure 9-20 a and b are 5 and 95 percentiles, respectively.a. Compute t, and V, for each of the four
Verify the expected time and variance for event (4004-1 99), and verify the the probability of 0.12 given for activity (4004-743)-(4004-199) in Figure 9-13b. Note: the values of a and b given in this figure are the end points of the distribution of activity performance time as used in conventional
Verify the Central Limit Theorem by sampling, that is, by tossing three dice and recording the results on graphs, such as those shown in Figure 9-6. For convenience, use a white, a red, and a green die. Call the number of spots on the white die, X, and plot on the first figme. Call the number of
*Consider the simple project network shown in Figure 8-1 1, along with the accompanying activity time-cost trade-off curves. Using the linear (integer)programming techniques described in the appendix to this chapter, write the linear programming formulation of this problem, and determine the
In the appendix to this chapter, the linear programming formulations are given for activity time-cost trade-off curves that are either continuous, or a collection of feasible timecost points. These formulations can be extended to cover the case where combinations of these two types of trade-off
Given in Table 8-3 are the data for a steam calendar and pipeline maintenance project. Three sets of times are given under columns headeda, m, andb. In this problem only the first two columns will be used: the times under the column headed a are the "crash" activity performance times while those
Given below are the network data and the timetost trade-off data for a small maintenance project. Table 8-2 Predecessor Normal Job (Activity) Jobs (days) (dollars) Crash (days) ABCDEFG none none none A Total 140 50 100 55 A 7 115 B, D 100 610 3625274 50 2413252 Cost Slope (dollars/day) 50 60 30 40
Verify the project schedule shown in Figure 7-9 using the Burgess algorithm.
Schedule the example of Figure 7-4 using the Wiest procedure outlined in Figure 7-15. Assume that only resource type A is required, that the activity resource requirements of type A shown in Figure 7-4 are the "Normal crew size" and that the maximum and minimum loadings are one unit more or one
Repeat exercise 4 above, but instead of using the Min-LS rule to order activities in the OSS, use the "Greatest Resource Demand" (GRD) rule shown in Table 7-1. Use lowest job number in case of ties.
Using the new resource requirements given in (1) above for the network of Figure 7-4 and resources available of 8 type A, 8 type B, apply the basic scheduling procedure of Figure 7-1 1.
Using the shortest-job-first heuristic (SIO rule in Table 7-1) instead of the min-LS rule to order activities in the OSS, reschedule the network of Figure 7-4 with the basic procedure of Figure 7-13. Use lowest job number in case of ties.
Using the Burgess leveling procedure and the revised resource requirements above for the network of Figure 7-4, level the resource requirements as much as possible.
Suppose the resource requirements associated with each activity in the network of Figure 7-4 have changed to the following levels:a. Draw the ES and LS resource profiles.b. Construct the cumulative resource requirements curves.c. Calculate the lower-bound estimate of the average daily resource
The text lists several problems inherent in the design of network-based cost control systems having to do with activity accounting procedures. How do these problems appear to be handled in the ARTEMIS system?
The ARTEMIS Cost Performance Report shown in Figure 5-16 provides data on the 3 major elements of the Waste Disposal Plant project (Heater, - House, etc.). Using the information provided in this report, summarize the performance status of each of the 3 major elements in the current period, over the
Using the methods given in Chapter 7, schedule the activities in Figure 5-1 such that the project duration is minimized, subject to the constraint that the planned weekly expenditures never exceed $2,500.
For the network in Figure 5-1, assume that it is decided to plan that all dbtivities will begin at the ES times, except for the following activities, which are scheduled to begin at the times listed below: I I Activity AD HC GSchedukd Stan 35 94 5l1 Compute the planned cumulative costs for the
a. Complete the forward and backward pass calculations on the precedence diagram given below. Assume the project starts at 7=0, and that we have a scheduled project duration of 30 working days (latest allowable completion time). Also, assume that no splitting of activities is allowed.b. Indicate
Develop an example to illustrate a precedence diagram activity that is BiCritical (BC); that is, an activity that would cause an increase in project duration for either an increase or a decrease in its duration.Hint: Construct an activity that is reverse critical as a result of an active
In thd section called "Arrow versus Precedence Method" in Chapter 3, a projeclt is diagrammed in two forms. The arrow diagram is shown in Figure
Consider the precedence diagram network shown in Figure 4-1 9, with activ- /ity durations noted inside of each node..a. Compute the earlyllate startlfinish times for each activity, assuming that I no splitting is allowed, the ES time for the project is zero, and the LF for the project completion is
Redraw the network presented in Figure 4-7 using the node scheme, and show that the forward and backward pass, and path float calculations lead to the same results as obtained with an arrow diagram.
Redraw the network presented in Figure 4-5 using the node scheme.a. Complete only the forward pass computations, and show that they are adequate to identify the critical path, using the same procedure described in the text for Figure 4-5.tions. Check your results against Figure 4-6.b. Complete the
Referring to Figure 4-7 in the text, trace out the critical paths from end 1 events 109 and 2 1 1, using only the forward pass computations shown on I the network.a. From this information alone, can you say which path is the critical path?b. Explain why you need the backward pass computations, or a
Update the network given in Figure 4-6 based on the following activity progress report submitted at the end of the fifth working day.Activity Start Time Finish Tim Modifications 0-1 1 3 - 1-2 5 - -0-3 0 2 - 3-4 3 - - 3-7 2 - - 0-6 5 - - 5-8 - - Activity duration estimate increased to four days for
The network plan in exercise 5 is subject to criticism because failure to pass the pressure test could result in several problems. How would you network this project to avoid this criticism, and what is its effect on the expected project duration?
A reactor and storage tank are interconnected by a 3" insulated process line that needs periodic replacement. There are valves along the lines and at the terminals and these need replacing as well. No pipe and valves are in stock. Accurate, as built, drawings exist and are available. The line is
It is possible to modify the network in Figure 4-7 so that the correct basic scheduling computations can be carried out by the simple procedure de- scribed at the beginning of this chapter. The required modifications are in the form of dummy type activities with suitable time estimates. For exam-
a. In exercise 2 what is the critical path?b. In exercise 2 what is the effect of assigning a scheduled time of event 106, or a time of 12 to event 106?
Redraw the network shown in Figure 4-7 and perform the network cohputations using the following scheduled times.a. The main project is scheduled to start at time zero.days after the start of the main project.~b. The activities leading to event 210 are scheduled to be completed 12c. The scheduled
a. In Figure 4-6, suppose an activity 7-5 must be added to the netLork which requires 1 time unit to carry out. Will this change any of the times computed in the basic scheduling computations? Ib. What time value for activity 7-5 would cause it to just become critical?c. Suppose the project
Figures 3-12 and 3-13 are networks of the fist slab of construction problem defined by Crandall. Extend the network to include the second and thud slabs, using (a) the arrow method and (b) procedence diagamming.
Discuss how the level of detail used in a network may be influenced by the purpose and readership of the network. Consider the viewpoints of different levels of management, such as: the project superintendent for a high-rise office building; the president of a television manufacturing firm that is
The network shown in Figure 3-16 is an early application of critical path methods by the Pure Oil Company, which was published in 1963.~ Review the network and answer the following questions:a. Assuming a computer was used to process this network, could any of the dummies be eliminated without
Some persons who supervise part of the work in a project, such as department heads or subcontractors, may inflate their time estimates somewhat in order to more easily stay on schedule and reduce attention and pressure by the general manager of the project. How will theuse of network methods and
Considering only the material covered in Chapters 2 and 3, list the ways in which network methods can be used to improve communications among project personnel, including management, supe~sors, subcontractors, suppliers, and the owner or end-user of the project results.
Considering Chapters 2 and 3 only, and the initial planning phase of projects(prior to scheduling computations), what planning techniques can reasonably be used to shorten the total project duration?
Condense the network in Figure 3-15 without distorting the logic.
Condense the network in Figure 3-14 to 10 activities or less, without distorting the dependency relationships. A B E N F 4 K R M Figure 3-14 -O- 0
Redraw the detailed network of typical floor shown as part of Figure 3-9, using an activity-on-node scheme. Then condense the network into a node format containing 12 or fewer activities. Compare with the condensed version in Figure 3-9.
Redraw the network in Figure 3-4b, using an activity-on-nodescheme. What advantages and disadvantages of the node scheme do you see in this example?
Using the basic node scheme, draw the networks described in exercises 3,4, and 6.
A common error in networking is to place the activities in the network according to the order in which you plan to carry them out, rather than in the order dictated by technological predecessor-successor relationships. Consider the following network.The network was drawn this way because the
Consider as a project the servicing of a car at a filling station, including such normal activities as filling the gas tank, checking the oil, etc. List the activities you wish to include, then draw a network of the project. Assume that there are two people available to senrice the car and that the
Draw a network of the following steam pipe maintenance project. The project begins by moving the required material and equipment to the site(5 hours). Then we may erect a scaffold and remove old pipe and valves (3 hours); while this is being done, we may fabricate the new pipe (2 hours).When the
Assume that the following list of activity dependencies is correct. The diagram in Figure 2-29, however, does not represent these dependencies properly. Correct the diagram using only one dummy activity.
Figure 2-28 shows a portion of a network for construction of a multi-story building. What do the dummies 29-33 and 34-38 represent? Can you find other dependencies of this type in the network?
Using the' list of activity dependencies given below, draw an accurate and economical (minimizing the use of dummies) network.Activity Depends on Activity A none B -A F A H A C B D 8 E C Activity Depends on Activity G F I F J H K I and J L G, D, andE M K N L and M
Given the activities and relationships listed below, draw an accurate network with no more than six dummies. Check your results by (1) numbering each event (do not repeat any numbers) and determining that no activity or dummy has the same pair of identification numbers, (2) making sure that there
In Figure 2-27 find at least five errors or unnecessary symbols. State which rule is broken in each case, and suggest how the error might be corrected. A C E G H DD CC L EE X Figure 2-27 AA S FF BB
Review the machinery installation sample network in Figure 2-17 and assume that an activity consisting of "schedule inspector" must precede "inspect machine." Add the activity to the network without causing a false dependency.
Can you think of any complex projects in which critical path methods would not be of any particular value? Give examples and discuss why.
Discuss various applications of critical path methods. For example, suppose you are in charge of the preparation of a proposal for a large and involved project, or the coming church social, or the preparation of a new college curriculum, or the development of a new product and manufacturing
Prepare a "cradle-to-grave" list of steps involving critical path methodology that would routinely be applied to potential new projects in an aerospace electronics firm or in a construction firm. Break up this list into stages such as bid--stage, initiation of work stage, work-in-process stage, and
Develop an expression for the number of iterations required to process separately two networks that have mutual interfaces. The expression should be a function of the number of changes in direction among the interfaces.
Referring to exercise 3 in Chapter 9, assume the times given under a and b are 0 and 100 percentiles, so tl1at tl1e standard deviation, (V. ) 112 =( b-a ) /6, and the times under the m column are single time estimates of the mean, i.e., t, = m, in this case. Without making a complete PERT
Repeat exercise 7 for the network given in Figure 11-1 making the same assumptions as suggested in exercise 7 about the distributions of activity performance times. To carry out this exercise, use the following values ofa, m, and b
Solve exercise 3 using the Monte Carlo approach described in the �ext. For simplicity, assume that the distribution of performance times for each activity is rectangular between the limits given by a andb. Using a table of random numbers that are uniformly distributed on the range from 0 to 1,
Repeat exercise 5 on the assumption that event '7 has occurred 2 days late, i.e", at the end of the 12th day.
With reference to Figure 1 1-1, what is the ( conditional) probability that event 8 will be completed on or before the end of the 16th day, assuming that a scheduled time of 10 is met on event 7?
With reference to Figure l l-1, what is the probability that event 8 will be completed on or before the end of the 12th day, assuming all activities are started as early as possible? What scheduled time for the entire project would you feel 95 percent confident of meeting without having to expedite
Consider the oversimplified network given in Figure 11- 19, which might be only a portion of a larger network, a portion which is subject to considerable chance variation in the perfmmance times. In Figure 11-19, a and b are 5 and 95 percentiles, respectively.a. Compute t, and V, for each of the
Verify the expected time and variance for event ( 4004- 199 ), and verify the probability of 0.12 given for activity (4004-743 )-(4004-199) in Figure l l-13b. Note : the values of a and b given in this figure are the end points of the distribution of activity performance time as used in
Verify the Central Limit Theorem by sampling, that is, by tossing three dice and recording the results on graphs, such as those shown in Figure 1 1-6. For convenience, use a white, a red, and a green die. Call the number of spots on the white die, X, and plot on the first figure. Call the number of
In the Allen Bros. & O'Hara System 24-month moving averages of cost data are maintained. What practical advantages would there be to using exponential smoothing in this application instead of moving averages?
The text lists several problems inherent in the design of network cost control systems. How are these problems approached in the Hughes system?
Using the methods given in Chapter 8, schedule the activities in Figure 10-1 such that the project duration is minimized, subject to the constraint that the planned weekly expenditures never exceed $2,.500.
For the network in Figure 10-1, assume that it is decided to plan that all activities will begin at the ES times, except for the following activities, which are scheduled to begin at the times listed below:Activity 0-1 1 -2 2-5 0-6 6-7 Scheduled Start 35 94 5Compute the planned cumulative costs for
An application of the CPM time-cost trade-off procedure is given on pages 232-235 of Appendix 9-1. As shown there, it is a "tabular" node labeling procedure. Develop a scheme for carrying out this algorithm on the network itself. Suggestion: draw and label the network as shown in Fig. 9-14, adding
tin the appendix to this chapter, the linear programming formulations are given for activity time-cost trade-off curves that are either continuous, or a collection of feasible time-cost points. These formulations can be extended to cover the case where combinations of these two types of trade-off
Write out a detailed set of instructions for the third hand computational time-cost trade-off rule, which could be programmed on a computer.
Given in Table 9-3 are the data for a steam calender and pipeline maintenance project. Three sets of times are given under columns headeda, m, andb. In this problem only the first two columns will be used ; the tin}es under the column headed a are the "crash" activity performance times while those
Repeat exercise 1 assuming each activity has a continuous linear time-cost trade-off curve, and using CPM computational algorithm in Appendix 9-1.
Given below are the network data and the time-cost trade-off data for a small maintenance project. Table 9-2. Normal Crash (days) (dollars) (days) Cost Slope (dollars/day) Predecessor Job (Activity) Jobs ABCDEFG none none none A A B, D Total 3625274 50 140 50 100 55 2413252 50 60 30 40 30 888 188
Rework the example presented in the text in Figure 8-3 using the Wiest procedure outlined in Figure 8-7. To carry this out, assume that the crew requirements slated in Figure 8-7 are normal loadings, and the maximum and minimum loadings are one crew more or one crew less, respectively.a. Write out
Verify the project schedule shown in Figure 8-6 using the Wiest leveling procedure, omitting the random selection feature of this procedure.
"Consider the network shown in Figure 8-8, which represents one cycle of work which is to be repeated many times in a project. Since the longest activity in this cycle has a duration of 16 days, assume that the cycle is to be repeated at 16-day intervals. If each activity in the network requires
Verify the project schedule shown in Figure 8-5 using the Burgess leveling procedure.
Repeat the illustrative Limited Resource Allocation example given in Figure
Suppose you are planning to use the same set of concrete forms on certain of the activities making up the project networked in Figure 8-1.a. If the forms are needed on activities 0-3, 0-1, 2-5, and 7-8, can they be scheduled so that only one set of f01ms are required, and so that the project is not
Write a computer program following the node diagram logic shown in Figure 7-7, to perform the basic scheduling computations.
Write a computer program following the logic developed in exercise 2.
Draw a node diagram for the network in Figure 7-1 and carry out the computational procedure developed by Montalbano and illustrated in Figure 7-8.
Draw a computer flow diagram representing the logic you would use to program the scheduling computation procedure described in Table 7-1.

Showing 5100 - 5200 of 5917

First
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
Last

Project Management With CPM And PERT 2nd Edition Joseph J. Moder, Cecil R. Phillips - Solutions

Step by Step Answers