Finding the critical path in an activity network with time-switch constraints

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

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

Title:	Finding the critical path in an activity network with time-switch constraints
Authors:	Yang,HH;Chen,YL
Contributors:	資訊管理研究所
Keywords:	PERT NETWORKS;COMPLETION-TIME
Date:	2000
Issue Date:	2010-07-06 17:53:26 (UTC+8)
Publisher:	中央大學
Abstract:	An activity network is an acyclic graph with non-negative weights and with a unique source and destination. A project consisting of a set of activities and precedence relationships can be represented by an activity network and the mathematical analysis of
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	658	View/Open

社群 sharing