隨機作業時間下多重作業方式及資源限制下專案排程最佳化模式之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：56

、訪客IP：18.219.28.145

姓名

魏汝珊(Ru-san Wei) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

隨機作業時間下多重作業方式及資源限制下專案排程最佳化模式之研究
(The Research of Multi-mode Resource Constrained Project Scheduling Problem in Stochastic Working Time)

相關論文

★ 橋梁檢測人力機具排班最佳化之研究	★ 勤業務專責分工下消防人員每日勤務排班最佳模式之研究
★ 司機員排班作業最佳化模式之研究	★ 科學園區廢水場實驗室檢驗員任務指派最佳化模式之研究
★ 倉儲地坪粉光工程之最佳化模式研究	★ 生下水道工程工作井佈設作業機組指派最佳化之研究
★ 急診室臨時性短期護理人力指派最佳化之探討	★ 專案監造人力調派最佳化模式研究
★ 地質鑽探工程人機作業管理最佳化研究	★ 職業棒球球隊球員組合最佳化之研究
★ 鑽堡於卵礫石層施作機具調派最佳化模式之研究	★ 職業安全衛生查核人員人力指派最佳化研究
★ 救災機具預置最佳化之探討	★ 水電工程出工數最佳化之研究
★ 石門水庫服務台及票站人員排班最佳化之研究	★ 空調附屬設備機組維護保養排程最佳化之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

在全球經濟快速發展下，專案排程問題漸受重視。然隨專案規模的迅速成長，專案排程問題逐漸複雜化。過去的專案排程主要利用要徑法與計畫評核術進行專案作業排程，但近年來因環境資源匱乏，單憑考量時程的控管而未進一步考量有限的資源，將使決策缺乏整體最佳化分析。考慮有限的資源及資金的流動，資源限制下之專案排程、多重作業方式及資源限制下之專案排程以及具有折現現金流量之多重作業方式及資源限制下之專案排程等問題逐漸受人重視。但除資源及資金，為符合現實情況，應將作業工期時間的隨機性納入考量，因為過去專案排程的研究多以平均作業工期時間為依據以進行專案作業排程，此作法未考量實際作業工期時間的隨機性。當作業在實際施作時，若隨機作業工期時間擾動過大，將使原規劃的排程結果失去最佳性。因此，本研究針對多重作業方式及資源限制下最大淨利潤專案排程問題，考量現金流量時間價值及相關作業流程與資源限制，構建一隨機性作業工期時間之專案排程模式，協助決策者有效地進行規劃。本研究利用時序網路流動技巧及數學規劃方法構建一數學模式，以期望淨利潤最大化為目標。此模式為一含額外限制整數網路流動問題，可利用CPLEX數學規劃軟體求解。為測試本研究模式求解績效，本研究以國際測試題庫(PSPLIB)所提供之專案資訊，進行一範例研究，並針對不同參數進行敏感度分析與方案分析，測試結果良好，最後提出結論與建議。

摘要(英)

Due to the fast development of global economy, project scheduling is more and more important. Because the project size grows rapidly nowadays, the project scheduling problem is much more complex than before. Traditionally, the critical path method (CPM) and the program evaluation and review technique (PERT) were used to formulate the project scheduling problems. The past time-controlled process for CPM and PERT is neither efficient nor effective from a system perspective, especially due to the short of environment resources recently. Considering of the resource finite and cash flow, resource constrained project scheduling problem (RCPSP), multi-mode resource constrained project scheduling problem (MRCPSP) and multi-mode resource constrained project scheduling problem with discounted cash flow (MRCPSPDCF) are researched in many years. Not only sources and money but stochastic disturbances arising from variations in working time in actual operations should be noticed. The past researches on the project scheduling is mainly based on the average working time, which do not consider the stochastic working time. Therefore, when actual project scheduling is affected by stochastic working time, the already planned project scheduling will be disturbed and lose its system optimization. Dealing with the multi-mode resource constrained project scheduling problem with discounted cash flow (MRCPSPDCF), this research adopts the time-precedence network technique to formulate a stochastic project scheduling model which considers the cash flow value of time and related operating and resource constraints. The model is formulated as an integer network flow problem with side constraints, which is characterized as NP-hard in terms of optimization. We employ the CPLEX mathematical programming solver to solve the problem. Otherwise we do the numerical tests to evaluate the performance of the proposed model, and the data comes from Project Scheduling Problem Library (PSPLIB).Performing sensitive and scenario analysis for different parameters, and the test results show the model to be good and that the solution method could be useful in practice. At last, conclusions and suggestions are given.

關鍵字(中)

★ 隨機性工期時間
★ 期望淨利潤
★ 具有折現現金流量之多重作業方式及資源限制下之專案排程
★ 時序網路

關鍵字(英)

★ Time-precedence network
★ Stochastic working time
★ Expected net profit
★ Multi-mode resource constrained project scheduli

論文目次

摘要 I
ABSTRACT II
誌謝 III
目錄 IV
圖目錄 VI
表目錄 VIII
第一章緒論 1
1.1 研究背景與動機 1
1.2 研究目的與範圍 3
1.3 研究方法與程式架構 4
第二章文獻回顧 5
2.1考慮淨現值之多重作業方式及資源限制下專案排程設計 5
2.2淨現值用於專案排程相關文獻 7
2.3 時空網路設計相關文獻 9
2.4 隨機擾動之相關理論與文獻 10
2.5大型含額外限制之整數網路流動問題啟發式演算法 16
2.6 文獻評析 19
第三章模式構建 20
3.1 基本假設與已知資訊 20
3.2 虛擬作業節線設計 22
3.3隨機性模式作業時序網路設計 27
3.4 最早及最晚開始/完成時間設計 35
3.5 流量調整係數 41
3.6 符號說明 42
3.7 隨機性數學模式 44
3.8確定性專案作業排程模式 45
3.9 模擬評估方法 47
3.10 範例測試 48
3.11 模式應用 53
3.12 小結 53
第四章範例測試 54
4.1 資料分析 54
4.2 模式發展 57
4.3電腦演算環境及設定 59
4.4 測試結果與分析 61
4.5 敏感度分析 67
4.6 方案分析 84
4.7小結 87
第五章結論與建議 88
5.1 結論 88
5.2 建議 89
5.3 貢獻 90
參考文獻 91

參考文獻

1. 江孝頤，「隨機旅行時間下混凝土生產作業及拌合車調派決策之研究」，碩士論文，國立中央大學土木工程學系 (2008)。
2. 邱明琦、陳春益、林佐鼎，「海運貨櫃排程模式之研究」，運輸計劃季刊，第三十一卷，第三期，第495-522頁 (2002)。
3. 余秀梅，「多元商品模式應用在動態貨櫃調度問題之研究」，碩士論文，國立成功大學交通管理科學系 (1994)。
4. 林士鈞，「定期貨櫃運輸船舶排程暨船期表建立之研究」，碩士論文，國立中央大學土木工程學系 ( 2006)。
5. 陳妙珍、顏上堯、張珮璇，「航空公司資產與負債管理模式之建立」，第四屆海峽兩岸會計與管理學術研討會論文集，武漢 (2000)。
6. 朱麗穎，「航商現金流動模式之研究」，碩士論文，國立成功大學交通管理科學研究所 (1997)。
7. 陳聖鈺，「隨機旅行時間下災後工程搶修物料補給排程之研究」，碩士論文，國立中央大學土木工程學 (2010)。
8. 張佩璇，「航空公司資金流動規劃模式之建立」，碩士論文，國立中央大學土木工程學系 (2000)。
9. 張軍、陳偉能、黃韜，「運用蟻群算法優化項目調度中的折現現金流的方法」，中華人民共和國國家知識產權局 (2008)。
10. 張恭文，「隨機旅行時間下拌合廠臨時性故障之混凝土生產與拌合車派遣規劃之研究」，碩士論文，國立中央大學土木工程學系 (2009)。
11. 黃培修，「專案排程與資源調派整合模式」，碩士論文，國立成功大學土木工程學系 (1999)。
12. 曾貽威，「考量現金流量之專案多重資源排程最佳化之研究」，碩士論文，朝陽科技大學營建工程學系 (2001)。
13. 楊建邦、陳春益、張永昌，「動態網路應用於航現金流動問題之研究」，中華民國第四屆運輸網路研討會 (1999)。
14. 劉秋蘭，「多重作業方式及資源限制下最大淨現值專案排程模式暨求解演算法之研究」，碩士論文，國立中央大學土木工程學系 (2011)。
15. 鄭逸亮，「以最大-最小螞蟻系統解決多模式有限資源專案排程問題之研究」，碩士論文，國立高雄第一科技大學電腦與通訊工程系 (2007)。
16. 顏上堯、翁綵穗，「季節轉換間緩衝期飛航排程之研究」，運輸計劃季刊，第三十卷，第四期，第891-921頁 (2001)。
17. 顏上堯、齊志仁、湯慶輝，「隨機需求下多目標長途客運排程模式之研究」，運輸計畫季刊，第34卷第1期，第93-118頁 (2005)。
18. Ballestín, F., Barrios, A. and Valls, V., “An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags,” Journal of Scheduling, 14(4), pp. 391-406 (2011).
19. Benders, J. F., “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, Vol. 4, pp. 238-252 (1962).
20. Chen, C. Y. and Kornhauser, A. L., “Decomposition of convex multicommodity network flow problem,” Report SOR-90-19, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1990).
21. Chen, W.N., Zhang, J., Chung, H.S., Huang, R.Z., and Liu, O., “Optimizing Discounted Cash Flows in Project Scheduling-An Ant Colony Optimization Approach,” IEEE Transactions on system, 40(1) (2010).
22. Hartmann, S., “Project scheduling with multiple modes - A genetic algorithm,” Annals of Operations Research, 102(1), pp. 111-135 (2001).
23. Icmeli, O. and Erenguc, S.S., “The resource constrained time cost tradeoff project scheduling problem with discounted cash flows,” Journal of Operations Management, 14, pp. 255-275 (1996).
24. Kenyon, A. S. and Morton, D. P., “Stochastic vehicle routing with random travel times,” Transportation Science, 37, pp. 69-82 (2003).
25. Kennington, J. L. and Shalby, M., “An effective subgradient procedure for minimum cost multicommodity flow problem,” Management Science, Vol. 23, pp.994-1004 (1977).
26. Kolisch, R., Sprecher, A. and Drexl, A., “Characterization and generation of a general class of resource-constrained project scheduling problems, ” Management Science , 41, pp. 1693–1703 (1995).
27. Lai, M. F. and Lo, H. K., “Ferry service network design: Optimal fleet size, routing, and scheduling,” Transportation Research Part A, 38, pp. 305-328 (2004).
28. Lamatsch, A., “An approach to vehicle scheduling with depot capacity constraints,” in Desrochers, M. and Rousseau, J. M.(eds.), Lecture Notes in Economics and Mathematical System, Vol. 386, pp. 181-195 (1992).
29. Lee, B. C., “Routing problem with service choices,’ Flight transportation laboratory Report R86-4, Massachusetts Institute of Technology, MA (1986).
30. List, G. F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A., and Lawton, C. R., “Robust optimization for fleet planning under uncertainty,” Transportation Research Part E, 39, pp. 209-227 (2003).
31. Mika, M., Waligóra, G. and Węzglarz, J., “Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models,” European Journal of Operational Research, 164(3), pp. 639-668 (2005).
32. Ozdamar, L. “A genetic algorithm approach to a general category project scheduling problem,” IEEE Transactions on system, Man, and Cybernetics, Part C, 29, pp. 44-59 (1999).
33. Özdamar, L. and Dündar, H., “A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows,” Computers and Operations Research, 24(12), pp. 1187-1200 (1997).
34. Russell, A.H., “Cash flows in networks,” Management Science, 16, pp.357-373 (1970).
35. Simpson, R.W., A Review of Scheduling and Routing Model for Airline Scheduling, IX AGIFORS Symposium, Broadway, England (1969).
36. Matthew J. Sobel, Joseph G. Szmerekovsky and Vera Tilson c, “Scheduling projects with stochastic activity duration to maximize expected net present value,” European Journal of Operational Research, 198, pp. 697–705 (2009).
37. Teodorovic, D., Airline Operations Research, Gordon and Breach Science Publishers, New York (1988).
38. Teodorovic, D. and Guberinic, S., “Optimal dispatching strategy on an airline network after a schedule perturbation,” European Journal of Operational Research, Vol. 15, pp. 178-182 (1984).
39. Ulusoy, G. and Cebelli, S., “An equitable approach to the payment scheduling problem in project management,” European Journal of Operational Research, 127, pp. 262-278 (2000).
40. Ulusoy, G., Sivrikaya-S_erifo_glu, F. and S_ahin, S., “ Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows, ” Annals of Operations Research, 102 ,pp. 237–261 (2001).
41. Wang, D. Z. W. and Lo, H. K., “Multi-fleet ferry service network design with passenger preferences for differential services,” Transportation Research Part B, 42, pp. 798-822 (2008).
42. Wolfram Wiesemann, Daniel Kuhn and Berc Rustem, “Maximizing the net present value of a project under uncertainty,” European Journal of Operational Research, 202, pp. 356–367 (2010).
43. Yan, S. and Chen, H. L., “A Scheduling Model and a Solution Algorithm for Inter-city Bus Carriers,” Transportation Research, Vol. 36A, pp. 805-825 (2002).
44. Yan, S. and Chen, C. H., “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, 15, pp. 246-264 (2007).
45. Yan, S., Chi, C. J. and Tang, C. H., “Inter-city Bus Routing and Timetable Setting under Stochastic Demands,” Transportation Research, 40A, pp.572-586 (2006).
46. Yan, K.K., Talbot, F.B. and Patterson, J H., “Scheduling a project to maximize its net present value: An integer programming approach,” European Journal of Operational Research, 64, pp. 188-198 (1993).
47. Yan, S. Lai, W. and Chen, M., “Production scheduling and truck dispatching of ready mixed concrete,” Transportation Research, Part E, 44(1), pp. 164-179 (2008b).
48. Yan, S. and Shih, Y. L., “A Time-Space Network Model for Work Team Scheduling after a Major Disaster,” Journal of the Chinese Institute of Engineers, 30(1), pp. 63-75 (2007).
49. Yan, S. Tang, C.H. and Fu, T.C., “An airline scheduling model and solution algorithms under stochastic demands,” European Journal of Operational Research, 190, pp. 22-39 (2008a).
50. Yan, S. and Tseng, C.H., “A passenger demand based model for airline flight scheduling and fleet routing,” Computers and Operations Research, 29, pp. 1559-1581 (2002).
51. Yan, S. and Young, H. F., “A decision support framework for multi-fleet routing and multi-stop flight scheduling,” Transportation Research Part A, Vol. 30, pp. 379-398 (1996).

指導教授

顏上堯(Shang-Yao Yan)

審核日期

2012-8-24

推文