A certain assembly project requires the completion of each of 5 tasks. In the diagram, the tasks are represented by circles labeled A–E and the number above each circle represents the number of days needed to complete the task. Arrows indicate prerequisite tasks. For instance, the arrow from Task A to Task C indicates that Task A must be completed before Task C can be started. Unless otherwise prohibited by these constraints, several tasks can be worked on at the same time. The project is complete once all 5 tasks are completed.Use the drop-down menus to create the most accurate statements based on the information provided.The least number of days needed to complete the project is days.If the number of days needed to complete Task C is increased by 1 day, then the least number of days needed to complete the project .
正确答案:26,remains the same
做题笔记
暂无做题笔记
参考解析
提交我的解析
知识点概述 本题主要涉及项目管理中的关键路径(Critical Path)概念,以及任务依赖关系的逻辑判断。关键路径是项目中耗时最长的任务序列,决定项目的最短完成时间;任务依赖关系决定任务的先后执行顺序。
解析 1. 计算项目最短完成时间:
- 可能的任务路径有:
- 路径一:begin - A - B - end,总时间为8 + 5 = 13天;
- 路径二:begin - A - C - B - end,总时间为8 + 7 + 5 = 20天;
- 路径三:begin - A - C - E - end,总时间为8 + 7 + 5 = 20天;
- 路径四:begin - D - E - end,总时间为21 + 5 = 26天。
- 关键路径是耗时最长的路径,即begin - D - E - end,所以项目最短完成时间是26天。
2. 分析任务C时间增加的影响:
- 因为关键路径是begin - D - E - end,任务C不在关键路径上。
- 所以即使任务C的时间增加1天,项目最短完成时间不变。