English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94586/125118 (76%)
Visitors : 30520042      Online Users : 483
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/73714
    Please use this identifier to cite or link to this item: http://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 連結: http://dx.doi.org/10.1016/S0377-2217(96)00140-3
    DOI: 10.1016/S0377-2217(96)00140-3
    Appears in Collections:[企業管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    S0377221796001403.pdf799KbAdobe PDF583View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback