Critical path in an activity network with time constraints

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29683

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29683

题名:	Critical path in an activity network with time constraints
作者:	Chen,YL;Rinks,D;Tang,K
贡献者:	資訊管理研究所
关键词:	STOCHASTIC PERT NETWORKS;COMPLETION-TIME
日期:	1997
上传时间:	2010-06-29 20:38:09 (UTC+8)
出版者:	中央大學
摘要:	An acyclic graph with nonnegative weights and with a unique source and destination is called an activity network. A project comprised of a set of activities and precedence relationships can be represented by an activity network and the mathematical analysis of the network can provide useful information for managing the project. In a traditional activity network, it is assumed that an activity can begin any time after all of its preceding activities have been completed. This assumption does not adequately describe many practical situations, in which some kinds of time constraint an usually associated with an activity. In this paper, we investigate two types of time constraint commonly encountered in project management. The first is the time-window constraint, which assumes that an activity can begin its execution only in a specified time interval. The second is the time-schedule constraint, which requires that an activity begin only at one of pre-specified beginning times. An efficient, linear time algorithm for finding the longest path (critical path) and for analyzing the flow time of each are is developed for activity networks with these time constraints. (C) 1997 Elsevier Science B.V.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	518	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....