Ebook Fundamentals of project management (4th edition): Part 2
➤ Gửi thông báo lỗi ⚠️ Báo cáo tài liệu vi phạmNội dung chi tiết: Ebook Fundamentals of project management (4th edition): Part 2
Ebook Fundamentals of project management (4th edition): Part 2
ClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2 where the longest path is in the network and to see whether it will meet the target completion date. Since the longest path through die project determines minimum project duration, any activity on that path that takes longer than planned willcause the end date to slip accordingly, so that path is c Ebook Fundamentals of project management (4th edition): Part 2alled the critical path.Schedule ComputationsNormally, you would let a computer do these computations for you, so you may wonder why it is necessary tEbook Fundamentals of project management (4th edition): Part 2
o know how to do them manually. My belief is dial unless you know how the computations are done, you do not fully understand the meanings of float, eaClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2ations are done by the computer. (For most schedules, the computer has the added bonus of converting times to calendar dates, which is no easy task to do manually.)93Amaxan Mana^frent Associated • wnw.amarxtcrg94Fundamentals of Project ManagementFirst, consider what we want to know about the project Ebook Fundamentals of project management (4th edition): Part 2. If it starts at some time = zero, we want to know how soon it canbe finished. Naturally, in most actual work projects, we have been told when we musEbook Fundamentals of project management (4th edition): Part 2
t be finished. That is, die end date is dictated. Furthermore, the start date for die job is often constrained for some reason: resources won’t be avaClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2xed points in time. Whatever the case, we still want to knowFailure to consider resource allocation in scheduling almost always leads to a schedule that cannot be achieved.how long the project will take to complete; if it won’t fit into the required dme frame, then we will have to do something to sh Ebook Fundamentals of project management (4th edition): Part 2orten the critical path.In the simplest form, network computations are made for the network on the assumption that activity durations are exactly as sEbook Fundamentals of project management (4th edition): Part 2
pecified. However, activity durations are a function of the level of resources applied to the work, and, if that level is not actually available when ClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2made with resource limitations in mind. Another way to say this is that resource allocation is necessary to determine what kind of schedule is actually achievable'. Failure to consider resources almost always leads to a schedule that cannot be met.Initial schedulecomputations are made assuming that Ebook Fundamentals of project management (4th edition): Part 2unlimitedresources are available. This yields the best-case solution.Still, the first step in network computations is to determine where the criticalEbook Fundamentals of project management (4th edition): Part 2
path is in the schedule and what kind of latitude is available for noncritical work, under ideal conditions. Naturally, the ideal situation is one in ClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2the network are done without consideration of resource requirements. It is this method that is described in this chapter, and resource allocation methods are deferred to scheduling software manuals, as I said previously.Network RulesIn order to compute network start and finish times, only two rules Ebook Fundamentals of project management (4th edition): Part 2apply to all networks. These are listed as rules 1 and 2. Other rules are sometimes applied by the scheduling software it-setf. These are strictly a fEbook Fundamentals of project management (4th edition): Part 2
unction of die software and are not ap plied to all networks.Rule 1. Before a task can begin, all tasks preceding It must be completed.Rule 2. Arrows ClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine Ebook Fundamentals of project management (4th edition): Part 2xamine the node boxes in the schedule. Each has the notations ES, LS, EF, LF, and DU. These mean:ES = Early StartLS = LateStartEF = Early Finish1.1 = I .ate FinishDU - Duration (of the task)Forward-Pass ComputationsConsider a single activity in die network, such as picking up dash from the yard. Il Ebook Fundamentals of project management (4th edition): Part 2has a duration of fifteen minutes. Assuming that it starts at time - zero, it can finish as early as fifteen minutes later. Thus, we can enter 15 in tEbook Fundamentals of project management (4th edition): Part 2
he cell labeled EEClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determine ClHAniZU aProducing 0 Workable Schedulenee a suitable network has been drawn, with durations assigned to all activities, it is necessary to determineGọi ngay
Chat zalo
Facebook