1 / 15
文档名称:

9 Network analysis,Including PERT-CPM(P).pdf

格式:pdf   页数:15
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

9 Network analysis,Including PERT-CPM(P).pdf

上传人:中国课件站 2011/12/7 文件大小:0 KB

下载得到文件列表

9 Network analysis,Including PERT-CPM(P).pdf

文档介绍

文档介绍:Session 9 运筹学Operations Research 9-1
运筹学运筹学
Operations Research Operations Research work analysis, including PERT-CPM
Core problem:
work analysis, ¾ The shortest-path problem
¾ The minimum spanning tree problem
including PERT-CPM The minimum spanning tree problem
¾ The maximum flow problem
¾ The minimum cost flow problem
¾ The project planning and control with PERT and
CPM.
江西财经大学信息管理学院©2006 江西财经大学信息管理学院©2006
School of Information Technology, JiangXi University of Finance & Economics©2006 1 School of Information Technology, JiangXi University of Finance & Economics©2006 2
运筹学运筹学
Operations Research work analysis, including PERT-CPM Operations Research Prototype Example
Prototype Example
SEERVADA PARK has recently been set aside for a
limited amount of sightseeing and backpack hiking. Cars are A
7 5
not allowed into the park, but there is a narrow, winding road 2 D
2 T
system for trams and for jeeps driven by the park rangers. 4
This road system is shown (without the curves) in , O 5 B 1
3
where location O is the entrance into the park; other letters 7
where location O is the entrance into the park; other letters 4 1
designate the locations of ranger stations (and other limited 4 E
C
facilities). The numbers give the distances of these winding
roads in miles.
江西财经大学信息管理学院©2006 江西财经大学信息管理学院©2006
School of Information Technology, JiangXi University of Finance & Economics©2006 3 School of Information Technology, JiangXi University of Finance & Economics©2006 4
运筹学运筹学
Operations Research work analysis, including PERT-CPM Operations Research The Terminology works
The Terminology works
¾ work: work that has only directed
¾ Network: work consists of a set of points and a arcs is called a work; (work)
set of lines connecting certain pairs of the points;
¾ Path: a path between two nodes is a sequence of
¾ Node: the points of work are called nodes; distinct arcs connectin