首页土木建筑建筑经济学工程管理专业英语 11 Unit Eleven The Critical Path Method.pptx

11 Unit Eleven The Critical Path Method.pptx

页数:17页文件大小:100.2 KB来源: 工程管理专业英语ppt课件

本课件为《工程管理专业英语》Unit Eleven 关键路径法(The Critical Path Method)单元教学内容,含词汇短语与问答两部分,先列出本单元核心术语的英汉对照释义,再以英文问答复述关键路径的定义与前提、时间参数的计算方法等要点,适用于专业英语阅读与翻译训练。

关键路径法单元词汇章节标题页,标示 Vocabulary, Phrases and Expressions 词汇与短语部分开始
关键路径法单元词汇页,收录关键路径法、关键路径的持续时间、最长可能路径等英汉术语对照与释义
关键路径法单元词汇页,收录网络节点、紧前工作、紧后工作等英汉术语对照与释义
查看本课件的文字版(共 17 页,供检索与复制)

第1页:Unit Eleven 词汇与短语

Vocabulary, Phrases and Expressions(词汇与短语)

本页为 Unit Eleven The Critical Path Method(关键路径法)单元的词汇部分标题页,其后各页按词条列出本单元核心术语的英文表达与中文释义。

第2页:关键路径与网络计划词汇

关键路径与网络计划词汇:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。

the critical path method (CPM)
关键路径法
duration of the critical path
关键路径的持续时间
the longest possible path
最长可能路径
fixed duration
固定持续时间
precedence relationships
前后顺序关系
resource constraint
资源限制
precedence constraint
优先限制
a network plan
网络计划

第3页:网络图节点与紧前紧后工作

网络图节点与紧前紧后工作:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。

nodes in a network
网络节点
predecessor activities
紧前工作
successor activities
紧后工作
graphical network
图解网络计划
an activity-on-branch network
有分枝的网络计划
dummy activities
虚工作
an activity-on-branch network
双代号网络计划图
an activity-on-node network
单代号网络计划图

第4页:时间参数与约束条件词汇

时间参数与约束条件词汇:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。

precedence of a finish-to-start nature
结束――开始型顺序
constraints
约束条件
a linear programming problem
线性规划问题
network structure
网络结构
the earliest starting time
最早开始时间
the latest starting time
最晚开始时间
the earliest finishing time
最早结束时间
the latest finishing time
最晚结束时间

第5页:时间参数算法与关键工序

时间参数算法与关键工序:Unit Eleven The Critical Path Method(关键路径法)单元词汇与短语,下列词条给出英文术语与中文释义。

event (or node) numbering algorithm
按节点编号算法
earliest event time algorithm
节点最早时间算法
latest event time algorithm
节点最晚时间算法
forward pass
顺向过程
backward pass
逆向过程
critical activities
关键工序

第6页:Unit Eleven 问题与解答

Questions and Answers(问题与解答)

本页为 Unit Eleven The Critical Path Method(关键路径法)单元的问答部分标题页,其后各页以英文问答形式复述本单元要点。

第7页:关键路径的定义

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.

第8页:关键路径法的前提假设

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.

第9页:最简单形式的关键路径计划

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.

第10页:图形网络表示的优点

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.

第11页:双代号网络中虚工作的作用

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.

第12页:双代号与单代号网络的区别

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.

第13页:最早与最晚开始时间的计算

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.

第14页:最早与最晚完成时间的计算

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.

第15页:关键工作的识别条件

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)

第16页:期望完工时间的确定

10. How to calculate the desired completion?

Usually, the desired completion time will be equal to the earliest possible completion time.

第17页:Unit Eleven 单元结束页

End of This Unit(本单元结束)

本页为 Unit Eleven The Critical Path Method(关键路径法)单元的结束页,标示本单元的词汇与问答内容到此结束。

顶部目录