Assume that an activity can begin only after two other activities are completed. If the earliest completion time of one predecessor is twenty days, and the earliest completion time of the other predecessor is seventeen days, then the earliest start time of this activity must be twenty days. 单项选择题
A
True
B
False

Question

Assume that an activity can begin only after two other activities are completed. If the earliest completion time of one predecessor is twenty days, and the earliest completion time of the other predecessor is seventeen days, then the earliest start time of this activity must be twenty days. 单项选择题

A

True

B

False

BlackTom AI · Accepted Answer

In this scheduling scenario, an activity that can begin only after two predecessors is constrained by the later of the two finish times, because both must be completed before starting. 
Option True: The earliest start time equals the maximum of the two predecessor finish times, which are 20 days and 17 days. The maximum is 20 days, so the earliest start time is 20 days. This aligns with the rule that you must wait for the slower predecessor to finish.
Option False: If you thought the earliest start time would be 17 days, you would be ignoring the requirement that both predecessors must complete before starting. Since one predecessor finishes at 20 days, you cannot start earlier than that, so 17 days is not feasible. 
Therefore, the statement provided in the question is consistent with the dependency rule and the computed start time. The reasoning hinges on taking the latest completion among the predecessors, not the earliest, to determine the start of the dependent activity.

类似问题

An activity with positive slack can be delayed without impacting the overall project completion time.

Why do network diagrams typically precede Gantt charts in complex projects?

As a project manager of a construction project, you need to use a tool to routinely monitor project timeline against the baseline, update WBS and track schedule. Which of the following is the most appropriate?

Part 1Which of the following was NOT a network planning method developed in the 1950s? A. the program evaluation and review technique (PERT) B. the network project analysis technique (NPAT) C. the critical path method (CPM)

What is the amount of time an activity may be delayed without delaying a succeeding activity or the project finish date?

What is a graphical network model that depicts a project’s tasks and the relationships between them?

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单