博碩士論文 91426020 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:9 、訪客IP:18.118.102.225
姓名 林昭凱(Jhao-Kai Lin)  查詢紙本館藏   畢業系所 工業管理研究所
論文名稱 考慮多模式專案排程下資源撫平之研究
(Resource Leveling in Multi-Mode Project Scheduling)
相關論文
★ 以價值鏈觀點探討品牌公司關鍵組織流程之取決-以S公司為例★ LED產業競爭策略分析-以隆達電子為例
★ 新產品開發階段之產品特性設計–以反光材料為例★ 專案範圍變動下應變成本之重新配置:系統動態學在專案風險管理的應用
★ 專案風險管理回應策略選擇模式之建立★ 多重相關專案選擇與排程之線性整數目標規劃模式
★ 應用基因演算法於多部門多重專案選擇與排程問題★ 應用田口方法於基因演算法輸入參數設計--以求解多模式專案排程下資源撫平為例
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 資源撫平(Resource Leveling)問題自從資源限制專案排程(Resource Constrained Project Scheduling Problem,RCPSP)發展以來就一直倍受重視,有許多的相關研究在解決這方面的問題。可是現有的資源撫平問題,都著眼在單一模式資源限制專案排程(Single-mode Resource Constrained Project Scheduling Problem,SRCPSP)上,在現實事件的專案中,單一模式的專案非常少見。而另依方面,再現有的多模式資源限制專案排程問題中,亦未見到相關資源撫平的文獻出現,因此本篇論文希望能將資源撫平的問題拓展於多模式資源限制專案排程問題(Multi-mode Resource Constrained Project Scheduling Problem,MRCPSP)之上。
本研究以資源撫平為目標,利用遺傳演算法同時進行作業模式(Mode)的選擇以及排程的結果。此外,利用遺傳演算中適應函數(fitness function)的調整,使得此演算法可以依照管理者不同需求而去調整適應函數以達到預期中希望達到的目標。
摘要(英) The fluctuation of required resources causes problem cause problem in project scheduling. Thus research developed resource leveling techniques to minimize the deviation between the resource requirement and the desired resourced profile. However, the resource leveling problem, can not be considered with Multi-mode Resource-Constrained Problem (MRCPSP), that is an activity can be preformed in one or more combinations of durations and resource requirements.
In this paper, we consider resource leveling in Multi-mode Project Scheduling. We describe a Genetic Algorithm for this problem. The proposed algorithm can effectibly provide the near-optimal solution for different situation and fit the goal that is project manager wanted.
關鍵字(中) ★ 專案排程
★ 資源撫平
★ 多模式資源限制專案排程問題
★ 遺傳演算法
關鍵字(英) ★ Resource leveling
★ Multi-Mode Resource Schedulin
論文目次 Abstract II
致謝 III
目錄 IV
表目錄 VI
圖目錄 VII
第 1 章 緒論 1
1.1 研究背景 1
1.2 研究動機 2
1.3 研究目的 3
1.4 研究流程 5
第 2 章 文獻探討 6
2.1 資源撫平的相關文獻探討 6
2.2 多模式資源線至專案排程問題的相關文獻探討 11
2.3 遺傳演算法文獻探討 14
2.3.1 編碼(encoding) 16
2.3.2 適應函數(fitness function) 16
2.3.3 選擇( selection ) 16
2.3.4 交配( Crossover ) 18
2.3.5 突變(Mutation) 20
2.3.6 收斂( convergence) 20
2.3.7 停止條件(Terminate Condition) 20
第 3 章 模式架構建立 22
3.1 問題描述 22
3.2 數學模式建立 23
3.3 演算法設計 27
3.3.1 編碼方式: 27
3.3.2 起始解 29
3.3.3 交配 30
3.3.4 突變 30
3.3.5 選擇及適應函數 30
第 4 章 實例驗證 33
4.1 案例產生 33
4.2 數據分析 35
4.2.1 實驗環境 35
4.2.2 實驗設計 36
4.2.3 數據分析 37
4.2.4 求解時間分析 42
4.2.5 解的改善 44
第 5 章 結論與未來研究方向 46
參考文獻 47
附錄A 52
附錄B 56
參考文獻 1. Antill, J.M. and Woodhead, R.W. (1990), Critical Path Methods in Construction Practice, 4th ed, Wiley Interscience
2. Bouleimen, K. and Lecocq, H. (2003),A New Efficient Simulated Annealing Algorithm for the Resource-Constrained Project Scheduling Problem and its Multiple Mode Version, European Journal of Operational Research, Vol.149, pp.268-281,2003
3. Davis, E.W. and Patterson, J.H. (1975),A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling, Management Science, Vol.21, pp.944-955
4. De Jong, K. A. (1987), On Using Genetic Algorithms to Search Program Space, Proceedings of the Second International Conference on Genetic Algorithm and Their Applications, pp. 210-216
5. Demeuleester, E. and Herroelen, W.S. (1992), A Branch-and-Bound Procedure for The Multiple Resource-Constrained Project Scheduling Problem, Management Science, Vol38, pp.1803-1818
6. Drexl, A. and Gr?newald, J. (1993), Nonpreemptive Resource-Constrained Project Scheduling, IIE Transactions, Vol.25, No.5, pp.75-81
7. Easa, S.M. (1989), Resource Leveling In Construction By Optimization, Journal of Construction Engineering and Management, ACSE, Vol.115, No.2 pp.302-316
8. Elwany, M.H., Korish, I.E., Aly Barakat, M., and Hafez, S.M. (1998), Resource Smoothening in Repetitive Projects, Computers induristrial Engineering, Vol.35, No. 3-4 pp.415-418
9. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley
10. Holland, J. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press
11. Kolisch, R. and Drexl, A. (1997), Local Search for Nonpreemptive Multi-Mode Resource-Constrained Project Scheduling IIE Transacitions, Vol.29, pp.987-999
12. Harris, R.B. (1978), Precedence and Arrow Networking Techniques for Construction, Wiley, New York
13. Harris, R.B. (1990), Packing Method for Resource Leveling (PACK),Journal of Construction Engineering and Management, ASCE, Vol.116, No.2, pp.331-350
14. Hartmann, S. and Drexl, A. (1998), Project Scheduling with Multiple Modes: A Comparison of Exact Algorithms, This is a preprint of an article published in Networks 32:283-297, www.interscience.wiley.com
15. Hegazy, T. (1999), Optimization of Resource Allocation and Leveling Using Genetic Algorithms, Journal of Construction Engineering and Management, ASCE, Vol.125, No.3, pp.167-175
16. Hegazy, T. and Tolga, E. (2001),it Simplified Spreadsheet Solutions.II:Overall Schedule Optimization, Journal of Construction Engineering and Management, Vol.127, No.6, pp.469-475
17. Heilmann, R. (2001), Resource-Constrained Project Scheduling: A heuristic for the Multi-mode case, OR Spektrum, Vol.23, pp.335-357
18. Hiyassat, M.A.S. (2000), Modification of Minimum Moment Approach in Resource Leveling, Journal of Construction Engineering and Management, ASCE, Vol.126, No.4, pp.278-284
19. Hiyassat, M.A.S. (2001), Applying Modified Minimum Moment Method to Multiple Resource Leveling, Journal of Construction Engineering and Management, ASCE, Vol.127, No.3, pp.192-198
20. Kolisch, R. and Sprecher, A. (1996), PSPLIB- A Project Scheduling Problem Library,Europen Journal of Operational Research, pp.205-219, 1996
21. Leu, S.S., Yang, C.H. and Huang J.C. (2000), Resource Leveling In Construction by Genetic Algorithm-based Optimization and Its Decision Support System Application. Automation in Construction, Vol.10, pp.27-41
22. Liz Maclachlan(1996), Making Project Management for You, Library Association Publishing, London.
23. Mattila, K.G. and Abraham, D.M. (1998),Resource Leveling of Linear Schedules using Integer Linear Programming, Journal of Construction Engineering and Management, ASCE, Vol.124, No.3, pp.232-244
24. Mori, M. and Tseng, C.C. (1997),A Genetic Algorithm for Multi-mode Resource Constrained Project Scheduling Problem, European Journal of Operational Research, Val.100, pp.134-141
25. Neumannn, K. and Zimmermann, J. (1999),Theory and Methodology Resource Levelling for Project with Schedule-Dependent Time Windows, European Journal of Operational Research, Vol.117, pp.591-605
26. Reyck, B.D and Horroelen W. (1999), The Multi-Mode Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations, European Journal of Operational Research, Vol.199, pp.538-556
27. Seibert, J.E. and Evans G.W. (1991), Time-Constrained Resource Leveling, Journal of Construction Engineering and Management, ASCE, Vol.117, No.3, pp.503-520
28. Slowinski,R., Soniewicki, B., and Weglarz, J. (1994), DSS for Multiobjective Project Scheduling, European Journal of Operational Research, Vol.79, pp.220-229
29. Son, J. and Skiboniewski, M.J. (1999), Multiheuristic Approach for Resource Leveling Problem in Construction Engineering Hybrid Approach, Journal of Construction Engeering and Management, Vol.125 NO.1, pp.23-31
30. Speranza, M.G. and Vercellis, C. (1993), Hierarchical Models for Multi-Project Planning and Scheduling, European Journal of Research, Vol.64, pp.312-325
31. Talbot, B. (1982), Resource-Constrained Project Scheduling with Time-Resource Tradeoff: the Nonpreemptve Case, Management Science, Vol.28, pp. 1197-1210
32. Woodworth, B.M. and Willie, C.J. (1975),A Heuristic Algorithm For Resource Leveling In Multi-Project, Multi-Resource Scheduling, Decision Sciences, Vol.6, pp.525-540
指導教授 曾清枝(Ching-Chih Tseng) 審核日期 2004-7-6
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明