English  |  正體中文  |  简体中文  |  Items with full text/Total items : 25444/26039 (98%)
Visitors : 6414125      Online Users : 411
RC Version 7.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


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


    Title: AN ENHANCED CRITICAL PATH METHOD FOR MULTIPLE RESOURCE CONSTRAINTS
    Authors: C.P.Lin
    H.L. Tai
    S.Y. Hu
    Contributor: National Taiwan Ocean University
    Keywords: critical path method
    Petri net
    resource constraints
    Date: 2013-11-02
    Issue Date: 2013-11-14 16:06:35 (UTC+8)
    Abstract: Traditional Critical Path Method considers only logical dependencies between related activities that may have to share common resources. The method has then been expanded to allow for the identification of resource- onstrained activities and the size of those resources.
    They are usually called activity-based resource assignments and leveling. However, once the number of resources increases, it becomes more and more difficult to draw the corresponding graph/network and explore the resource- constrained critical path. Therefore, in order to solve a multiple- esource-constrained project, the Petri Nets theory is introduced for modeling those resource sharing processes. Because Petri nets is commonly used for modeling the dynamic behavior of discrete systems, it is intended in this research to apply Petri net theory in modeling and analyzing complicated projects with multiple resource constraints. Furthermore, analysis on the size of each resource for performance enhancement can then be done by changing the numbers of tokens in each of the resource places that were added for resource constraints. Cost analysis has to be reconsidered since the additions of resources constraints will alter the original
    schedule of each activities and increase the duration of the project. Activity crashing may have to be done that shifts more resources towards required activity and results in decreased project duration.
    Appears in Collections:[機械工程系所] Automation 2013- The 12th International Conference on Automation Technology

    Files in This Item:

    File Description SizeFormat
    C001.pdf7KbAdobe PDF404View/Open
    CAD_FULL_0001.pdf446KbAdobe PDF0View/Open


    All items in KSUIR are protected by copyright, with all rights reserved.


    本網站之所有圖文內容授權為崑山科技大學圖書資訊館所有,請勿任意轉載或擷取使用。
    ©Kun Shan University Library and Information Center
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback