曾惠斌王明德臺灣大學：范素玲Fan, Su-LingSu-LingFan2007-11-252018-07-092007-11-252018-07-092005http://ntur.lib.ntu.edu.tw//handle/246246/50198工程實務上有許多相同的作業項目在不同的施工區域不斷地重複，這類工程稱之為重複性工程。例如高樓建築、集合住宅、公路工程及管涵工程等。網圖技術已廣泛應用於各類型之工程進度排程，然而其應用於重複性工程卻有許多缺點。本研究旨在解決應用網圖技術於重複性工程之三個缺點： 一、 網圖技術表達的複雜性：應用網圖技術表達重複性工程需要大量的作業項目，因此造成建立與更新進度時的困難度。 二、 無法表達不固定作業關係(Soft Logic)：網圖技術假定所有作業間關係皆為固定不變，然而工程實務上卻有許多作業間之關係是有各種不同排列組合的。 三、 無法確保工班連續性(Work Continuity) ：網圖技術僅考慮作業之前置後續關係，並未考量工班(資源)之連續性。 本研究發展之模式包含以下三個模組： 一、 輸入模組：依據工期、施工區域、.基本施作流程、施工區域之結構及作業關係將重複性工程分為2*2*2*2*2=32種類型，而後進一步發展可以表達各不同之重複性工程之界面，使排程者可輸入簡單之資料以表達重複性工程。 二、 進度模組：探討影響不固定作業關係排程之影響因素與排序之經驗法則，而後發展表達不固定作業關係及影響其排序因素之界面並利用物件導向技術發展不固定作業關係排序演算法。 三、 工班連續性模組：發展可確保工班連續性之演算法。Network techniques have been widely used as a project planning tool in the construction industry. However, the application of network techniques to repetitive projects has long been criticized. This research aims at overcoming three main drawbacks of applying network techniques in repetitive projects: 1) complexity of network representation 2) inability of representing soft logics and 3) difficulty of maintaining work continuity. This research develops a system which provides an input module which easily represents different types of repetitive projects in addition to scheduling and work continuity maintaining modules. The system simplifies the network generation and updates processes, which provides the near-shortest project duration logics or the start and finish dates to meet work continuity requirement.ABLE OF CONTENTS ACKNOWLEDGEMENT I ABSTRACT II TABLE OF CONTENTS III LIST OF FIGURES V LIST OF TABLES VII CHAPTER 1　INTRODUCTION 1 1.1 BACKGROUND AND MOTIVATION 1 1.2 PROBLEM STATEMENTS 2 1.3 RESEARCH OBJECTIVES 4 1.4 RESEARCH APPROACH 4 1.5 FRAMEWORK OF METHODOLOGY 5 1.6 FLOWCHART OF RESEARCH 7 1.7 STRUCTURE OF DISSERTATION 8 CHAPTER 2　LITERATURE REVIEW 9 2.1 SCHEDULING MODELS 9 2.2 REPETITIVE PROJECTS 15 2.3 SOFT LOGICS 15 2.4 OBJECT-ORIENTED TECHNIQUES 19 2.5 SUMMARY 22 CHAPTER 3　REPITITIVE PROJECTS WITH SOFT LOGICS 23 3.1 SOFT LOGICS 23 3.2 HEURISTIC FACTORS AND PRINCIPLES OF SOFT-LOGIC SEQUENCING 24 1. PREDEFINED PREFERENCE OR CONSIDERATION 24 2. SITE CONDITIONS AND RESOURCE LIMITATIONS 25 3.3 DATA INVOLVED IN REPRESENTING REPETITIVE PROJECTS WITH SOFT LOGICS 30 3.4 TYPES OF REPETITIVE PROJECTS WITH SOFT LOGICS 31 3.5 SUMMARY 35 CHAPTER 4　METHODOLOGY 36 4.1 INPUT MODULE 37 1. IDENTIFYING THE FIXED PRECEDENCE ACTIVITIES (FPA) 40 2. IDENTIFYING INTERCHANGEABLE ACTIVITIES 41 4.2 SCHEDULING MODULE 42 1. ASSUMPTIONS 42 2. ALGORITHMS 43 4.3 WORK CONTINUITY MAINTAINING MODULE 52 1. BACKWARD STAGE: 52 2. FORWARD STAGE 52 4.4 SUMMARY 53 CHAPTER 5 SYSTEM IMPLEMENTATION 54 5.1 SYSTEM IMPLEMENTATION 54 5.2 EXAMPLES AND DISCUSSION 56 1. INPUTTING 56 2. UPDATING 70 5.3 SUMMARY 72 CHAPTER 6　CONCLUSION 73 6.1 CONCLUSION 73 6.2 FUTURE WORK 74 REFERENCE 75 APPENDIX 80961044 bytesapplication/pdfen-US排程物件導向不固定作業關係重複性工程SchedulingObject-orientedSoft LogicsRepetitive Projectsthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/50198/1/ntu-94-D88521004-1.pdf