政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/73714

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 109948/140897 (78%)
Visitors : 46096941 Online Users : 916

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大典藏 > College of Commerce > Department of Business Administation > Periodical Articles > Item 140.119/73714

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/73714

Title:	Critical path in an activity network with time constraints
Authors:	Tang, Kwei;Chen, Yen-Liang;Rinks, Dan 唐揆
Contributors:	企管系
Keywords:	Activity network;Critical path;Longest path;Float time;PERT;Time-window;Time-schedule
Date:	1997
Issue Date:	2015-03-09 16:24:13 (UTC+8)
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 are 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 arc is developed for activity networks with these time constraints.
Relation:	European Journal of Operational Research, 100(1), 122-133
Data Type:	article
DOI link:	http://dx.doi.org/10.1016/S0377-2217(96)00140-3
DOI:	10.1016/S0377-2217(96)00140-3
Appears in Collections:	[Department of Business Administation] Periodical Articles

Files in This Item:

File	Description	Size	Format
S0377221796001403.pdf		799Kb	Adobe PDF2	690	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...