Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
-
No data in Web of Science(Wrong one)Loading...
Related Publications in TAIR
| Title | Critical path in an activity network with time constraints |
| Creator | Tang, Kwei;Chen, Yen-Liang;Rinks, Dan 唐揆 |
| Contributor | 企管系 |
| Key Words | Activity network; Critical path; Longest path; Float time; PERT; Time-window; Time-schedule |
| Date | 1997 |
| Date Issued | 9-Mar-2015 16:24:13 (UTC+8) |
| Summary | 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 |
| Type | article |
| DOI | http://dx.doi.org/10.1016/S0377-2217(96)00140-3 |
| dc.contributor | 企管系 | |
| dc.creator (作者) | Tang, Kwei;Chen, Yen-Liang;Rinks, Dan | |
| dc.creator (作者) | 唐揆 | zh_TW |
| dc.date (日期) | 1997 | |
| dc.date.accessioned | 9-Mar-2015 16:24:13 (UTC+8) | - |
| dc.date.available | 9-Mar-2015 16:24:13 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Mar-2015 16:24:13 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/73714 | - |
| dc.description.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. | |
| dc.format.extent | 819051 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | European Journal of Operational Research, 100(1), 122-133 | |
| dc.subject (關鍵詞) | Activity network; Critical path; Longest path; Float time; PERT; Time-window; Time-schedule | |
| dc.title (題名) | Critical path in an activity network with time constraints | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/S0377-2217(96)00140-3 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1016/S0377-2217(96)00140-3 | en_US |