页数:17页文件大小:100.2 KB来源: 工程管理专业英语ppt课件
本课件为《工程管理专业英语》Unit Eleven 关键路径法(The Critical Path Method)单元教学内容,含词汇短语与问答两部分,先列出本单元核心术语的英汉对照释义,再以英文问答复述关键路径的定义与前提、时间参数的计算方法等要点,适用于专业英语阅读与翻译训练。
Vocabulary, Phrases and Expressions(词汇与短语)
本页为 Unit Eleven The Critical Path Method(关键路径法)单元的词汇部分标题页,其后各页按词条列出本单元核心术语的英文表达与中文释义。
关键路径与网络计划词汇:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。
网络图节点与紧前紧后工作:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。
时间参数与约束条件词汇:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。
时间参数算法与关键工序:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。
Questions and Answers(问题与解答)
本页为 Unit Eleven The Critical Path Method(关键路径法)单元的问答部分标题页,其后各页以英文问答形式复述本单元要点。
1. How to define the critical path?
Thus, the critical path can be defined as the longest possible path through the “network”of project activities.
2. What be assumed by critical path scheduling?
Formally, critical path scheduling assumes that a project has been divided into activities of fixed duration and well defined predecessor relationships.
3. What is the simplest form of critical path scheduling?
No resource constraints other than those implied by precedence relationships are recognized in the simplest form of critical path scheduling.
4. What are the advantages of graphical network representation of the project schedule?
Graphical network representations rather than a list are helpful for visualization of the plan and to in sure that mathematical requirements are met.
5. For what purpose to introduce dummy activities with an activity-on-branch network?
With an activity-on-branch network, dummy activities may be introduced for the purposes of providing unique activity designations and maintaining the correct sequence of activities.
6.
To tell the difference between an activity-on-branch network and an activity-on-node network. dummy activities may be necessary to meet the requirements of precedence relationships inactivity-on-branch networks, but may not be required in activity-on-node networks.
7. How to calculate the earliest starting time and the latest starting time of an activity?
Earliest event times are computed as the maximum of the earliest start times plus activity durations for each of the activities immediately preceding an event.
8. How to calculate the earliest finishing time and the latest finishing time of an activity?
The procedure for finding the latest event time is analogous to that for the earliest event time except that the procedure begins with the final event and works backwards through the project activities.
9. How to identify the critical activities of the project schedule?
An activity (i, j) is a critical activity if it satisfies all of the following conditions: E (i)=L (i) E (j)=L (j) E (j)+ Dij= L (j)
10. How to calculate the desired completion?
Usually, the desired completion time will be equal to the earliest possible completion time.
End of This Unit(本单元结束)
本页为 Unit Eleven The Critical Path Method(关键路径法)单元的结束页,标示本单元的词汇与问答内容到此结束。
下载地址:{{downurl}}
{{{a}}}
{{#b}}{{{b}}}
{{/b}} {{/title}} {{#nolog}}登陆注册
{{/nolog}} {{#djsx}}点我刷新
{{/djsx}} {{#gocz}} {{/gocz}} {{#ffqr}} {{/ffqr}}