Critical path in an activity network with time constraints

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/29683

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29683

Title:	Critical path in an activity network with time constraints
Authors:	Chen,YL;Rinks,D;Tang,K
Contributors:	資訊管理研究所
Keywords:	STOCHASTIC PERT NETWORKS;COMPLETION-TIME
Date:	1997
Issue Date:	2010-06-29 20:38:09 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	518	View/Open

社群 sharing

Loading...