English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62568/95224 (66%)
造访人次 : 2531174      在线人数 : 222
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/120149

    题名: Object-Oriented Scheduling for Repetitive Projects
    作者: Fan, Su-Ling;Tserng, H. P.
    日期: 2006-01
    上传时间: 2021-03-11 12:13:11 (UTC+8)
    摘要: The application of network techniques of project scheduling to repetitive projects has been criticized for the inability of network techniques to help maintain work continuity. Moreover, current network techniques require a large number of activities to represent a repetitive project and presume that there is only one logical sequence. This makes schedules time consuming to develop as well as maintain. Further, the logic chosen by the planner might be far from the shortest possible duration. This paper, utilizing the soft logic sequencing principles developed by Fan et al., develops a system which provides an easy input module in addition to scheduling and work-continuity-maintenance modules. The system eases the network generation and update processes, which in turn provides the shortest possible duration logics and the start and finish dates required to maintain work continuity.
    關聯: Journal of Construction Engineering and Management 132(1), p.35-48
    DOI: 10.1061/(ASCE)0733-9364(2006)132:1(35)
    显示于类别:[土木工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    Object-Oriented Scheduling for Repetitive Projects.pdf1234KbAdobe PDF1检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈