臺灣博碩士論文加值系統

本研究旨在針對專案產能需求規劃與物料需求規劃問題進行有系統之研究，並針對此類問題提出最佳解模式及探索解法，以供實務界進行專案規劃之參考。此外，本研究也修正現行在有限資源專案排程問題中績效表現優越的法則，使之能適用於本研究之排程問題。最後，本研究針對影響專案排程問題績效的重要特性因素，進行測試樣本之實驗設計，並將本研究所提出之最佳解模式、探索解法及修正式探索解法進行績效評估分析。研究結果顯示，本研究所提出的最佳解法及探索解法之排程績效遠較其他探索解法優越。這些方法可提供專案經理有效調度公司的有限產能，並對專案物料之訂購時點、訂購數量之掌控能更為精確增進其專案作業的排程規劃與資源調度之適切性。

The purpose of this study systematically aims at project capacity requirements planning and material requirements planning (PCRP/MRP) for the use of project manager while planning and controlling specific event. Since previous studies focused on the project management are piled up to a certain scale centered on PCRP/MRP have little mentioned from a view of integrated planning framework. This model considers the discounted net present values and project material costs into the resource-constrained multi-project scheduling problem systematically and also develop two efficient solution procedures in terms of the optimal model and a particle swarm optimization-based algorithm. To test the superiority of model and algorithm proposed in this work, a comparison between the developed heuristic rule and current heuristic rules is also conducted followed by an analysis on key factor affecting the project scheduling performance. The implementation results indicate that the heuristic rule proposed in this work is superior the current heuristic rules. It is expected that the results of this study will provide a valuable reference for our industries to perform more efficient project scheduling plan.

摘 要 I
ABSTRACT II
誌 謝 III
目 錄 IV
圖目錄 VI
表目錄 VIII
1.緒論 1
1.1研究動機與目的 1
1.2 研究方法與架構 4
1.3研究範圍與限制 6
2.文獻探討 8
2.1有限資源專案排程問題 9
2.1.1資源的分類與定義 9
2.1.2有限資源專案排程問題之分類 10
2.2有限資源最大化總專案淨現值專案排程問題 13
2.3 專案物料需求規劃與產能需求規劃問題 16
2.3.1專案物料需求規劃 16
2.3.2專案產能需求規劃與物料需求規劃問題 19
2.4 粒子群優法 22
2.4.1粒子群優法之發展背景 22
2.4.2粒子群優法之概念說明 23
2.4.3粒子群優法之發展與相關應用 24
2.5 結語 27
3.模式建構 29
3.1基本假設 29
3.2 符號定義 30
3.3 最佳解模式建構 32
3.4粒子群優法 35
3.5修正式傳統二階批量法 39
4.釋例說明與績效評估分析 45
4.1釋例說明 45
4.1.1最佳解法釋例求解說明 47
4.1.2 粒子群優法釋例求解說明 49
4.1.3修正式傳統二階批量法釋例求解說明 52
4.2 最佳解法排程績效分析 56
4.2.1情境模擬設計 56
4.2.2 績效評估分析 58
4.3 粒子群優法排程績效分析 63
4.3.1情境模擬設計 63
4.3.2 粒子群優法之參數設定與分析 66
4.3.3排程績效評估分析 71
4.4實例應用說明 80
5. 結論與建議 85
5.1 結論 85
5.2 後續研究建議 87
參考文獻 89
附 錄 97
作者簡介 109

中文部分
胡曉輝，「粒子群優化算法介紹」， http://web.ics.purdue.edu/~hux/tutorials.shtml
邱煥能，「考慮現金流量現值之專案排程問題之研究」，國科會專題研究計畫成果報告，NSC86-2213-E-011-032 (1998)。
邱煥能，蔡登茂「有限資源多專案排程單專案排程法與多專案排程法之比較研究」，中國工業工程學刊，第十卷，第三期，第171-179頁(1993)。
張嘉君，「應用模擬退火法來求解營建工程專案多重資源排程最佳化之研究」，朝陽科技大學營建工程系碩士論文（2003）。
張榮芳，「電力用戶負載歸類及整合」，國立中山大學電機工程學系研究所博士論文（2002）。
葉思緯，「應用粒子群最佳化演算法於多目標存貨分類之研究」， 元智大學工業工程與管理學系碩士論文（2003）。
葉麗雯，「供應商產能有限及價格折扣下多產品多供應商最佳化採購決策」，元智大學工業工程與管理學系碩士論文，（2003）。
蔡登茂，「專案資源需求規劃與排程問題之研究」，國立台灣科技大學工業管理系博士論文（2001）。
蔡政峰，「求解有限資源專案排程問題最佳化之研究－以基因演算法求解」，碩士論文，國立成功大學工業管理研究所（2001）。
蕭博文，「應用禁忌搜尋法求解營建工程專案多重資源排程最佳化之研究」，朝陽科技大學營建工程研究所碩士論文（2002）。
賴豔君，「以塔布搜尋法求解作業關係不固定排程之研究，碩士論文」，
國立台灣科技大學營建工程系（2002）。
高文慶，「螞蟻演算法於有限資源專案排程最佳化之研究」，元智大學工業工程與管理學系碩士論文（2003）。

英文部分
Abbasi, G. Y. and Y. A. Arabiat, “A heuristic to maximize the net present value for the resource-constrained project scheduling problem,” Project Management Journal, 32, 2, 17-24 (2001).
Abido, M. A., “Optima Power flow using Particle Swarm Optimization,” Electrical Power and Energy System, 24, 563-571(2004).
Alfares, H. K. and J. E. Bailey, “Integrated project task and manpower scheduling,” IEE Transactions, 29, 9, 711-717(1997).
Ahn, T. and S. S. Erenguc, “Resource constrained project scheduling problem with multiple crash able modes: an exact solution method,” Technical Report, College of Business Administration University of Florida Gainesville (1995).
Ayed, S., I. Ahmad and A.-M. Sabah, “Particle swarm optimization for task assignment problem,” Microprocessors and Microsystems, 26, 363–371 (2002).
Baroum, S. M. and J. H. Patterson, “The development of cash flow weight procedures for maximizing the net present value of a project,” Journal of Operations Management, 14, 209-227 (1996).
Bell, C. E. and J. Han, “A new heuristic solution method in resource-constrained project scheduling,” Naval Research logistics, 38, 3, 315-331 (1991).
Böttcher J., A. Drexl, R. Kolisch and F. Salewski, “Project scheduling under partially renewable resource constraints,” Management Science, 45, 4, 543-559 (1999).
Boctor, F. F., “Heuristics for the scheduling projects with restrictions and several resource-duration modes,” International Journal of Production Research, 31, 11, 2547-2558 (1993).
Boyd, R. and J. Richerson, “Culture and the Evolutionary Process,” Chicago: University of Chicago Press (1985).
Cho, J. H. and Y. D. Kim, “A simulated annealing algorithm for resource constrained project scheduling problem,” Journal of the Operational Research Society, 48, 7, 736-744 (1997).
Chiu, H. N. and D. M. Tsai, “An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows,” Construction Management and Economics, 20, 1, 55-66 (2002).
Chiu, H. N. and D. M. Tsai, “An integer linear programming model and a modified branch and bound algorithms for project material requirements planning,” Journal of Information and Optimization Sciences, 24, 1, pp151-196 (2003).
De, P., J. Dunne, J. B. Ghosh and C. E. Wells, “The discrete time-cost tradeoff problem for project networks,” European Journal of Operational Research, 81, 225–38 (1995).
Dodin, B. and A. A. Elimam, “Integrated project scheduling and material planning with variable activity duration and rewards,” IEE Transactions, 33, 1005-1018 (2001).
De, P. G. W. and G. E. Whitehouse, “Applying the COMSOAL computer heuristic to the constrained resource allocation problem,” Computers and Industrial Engineering, 38, 413-422 (2000).
Doersch, R. H. and J. H. Patterson, “Scheduling a project to maximize its present value: a zero-one programming approach,” Management Science, 23, 8, 882-889 (1977).
Dorigo, M., V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” Technical Report, Politecnico di Milano, Italy No.91-106 (1991).
Eberhart, R. and J. Kennedy, “A New Optimizer Using Particle Swarm Theory,” Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 39-43 (1995).
Elmaghraby, S. E., “Activity networks: project planning and control by network models,” New York: Wiley(1977).
Herroelen, W., B. D. Reyck and E. Demeulemeester, “Project network models with discounted cash flows a guided tour through recent developments,” European Journal of Operational Research, 100, 97-121 (1997).
Herroelen, W., B. D. Reyck and E. Demeulemeester, “Resource- constrained project scheduling: a survey of recent developments,” Computers and Operations Research, 25, 279-302 (1998).
Hu, X. and R. Eberhart, “Multiobjcetive Optimization Using Dynamic Neighborhood Particle Swarm Optimization,” Proceedings of the 2002 Congress on Evolutionary Computation, Honolulu, H. I., 1677-1681 (2002).
Icmeli, O. and W. O. Rom, “Ensuring quality in resource constrained project scheduling,” European Journal of Operational Research, 103, 483–96 (1997).
Icmeli, O., “A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows,” Management Science, 42, 10, 1395-1408 (1996).
Kennedy, J. and R. Eberhart, “Particle swarm optimization,” Proceedings of IEEE International Conference on Neural Networks (ICNN’95), Perth, Australia, IV, 1942–1948 (1995).
Khattab, M. and F. Choobineh, “A new heuristic c for project scheduling with a single resource constraint,” Computers and Industrial Engineering, 20, 3, 381-387(1991).
Kelley, J. E., “The critical path method: resources planning and scheduling,” Ch.21 in Industrial Scheduling, Prentice-Hall, Englewood Cliffs, New Jersey (1963).
Kolisch, R. and R. Padman, “An integrated survey of deterministic project scheduling,” Omega, 29, 249–272 (2001).
Kolisch, R., “Efficient priority rules for the resource constrained project scheduling problem,” Journal of Operations Managemen, 14(3), 179–192(1996).
Kurtulus, I. and E. W. Davis, “Multi-project scheduling: categorization of heuristic rules performance,” Management Science, 28, 2, 161-172(1982).
Kurtulus, I. and S. C. Narula, “Multi-project scheduling: analysis of project performance,” IIE Transactions, 17, 1, 58-66 (1986).
Lova, A., C. Maroto and P. Tormos, “A multicriteria heuristic method to improve resource allocation in multiproject scheduling,” European Journal of Operational Research, 127, 408-424(2000).
Mingozzi, A., V. Maniezzo, S. Ricciardelli and L. Bianco, “An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation,” Management Science, 44, 5, 714-729 (1998).
Pavlidis, K., E. Parsopoulos and M. N. Vrahatis, “Computing Nash equilibrium through computational intelligence Methods,” Journal of Computational and Applied Mathematics, 175, 113–136, (2005).
Nazareth, T., S. Verma, S. Bhattacharya and A. Bagchi, “The multiple resource constrained project scheduling problem: a breadth-first approach,” European Journal of Operational Research, 112, 2, 347-366 (1999).
Neumann, K. and J. Zimmermann, “Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints,” European Journal of Operational Research, 127, 425-433 (2000).
Padman, R., D. E. Smith-Daniels and V. L. Smith-Daniels, “Heuristic scheduling of resource-constrained projects with cash flows,” Naval Research Logistics, 44, 4, 365-371 (1997).
Patterson, J. H., “Alternative methods of project scheduling with limited resources,” Naval Research Logistics Quarterly, 20, 4, 767- 784 (1973).
Patterson, J. H., “Project scheduling: the effects of problem structure on heuristic performance,” Naval Research Logistics Quarterly, 23, 1, 95-122 (1976).
Patterson, J. H., F. B. Talbot, R. Slowionski and J. Weglarz, “Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problem,” European Journal of Operational Research, 49, 1, 68-79 (1990).
Payne, J. H., “Management of multiple simultaneous projects: a state-of art review,” International Journal of Project Management, 13, 163-168(1995).
Pinder, J. P. and A. S. Marucheck, “Using discounted cash flow heuristics to improve project net present value,” Journal of Operations Management, 14, 229-240 (1996).
Russell, A. H., “Cash flows in networks,” Management Science, 16, 5, 357-373 (1970).
Russell, R. A., “A comparison of heuristics for scheduling projects with cash flows and resource restrictions,” Management Science, 32, 10, 1291-1300 (1986).
Raynolds, C. W., “Flocks, herds, and schools: A distributed behavioral Model,” Computer Graphics, 21, 4, 25-34(1987).
Salerno, J., “Using the particle swarm optimization technique to train a recurrent neural model,” In Proceedings of the Ninth IEEE International Conference on Tools with Artificial Intelligence, 45-49 (1997).
Sepil, C. and N. Ortac, “Performance of the heuristics procedures for constrained projects with progress payment,” Journal of the Operational Research Society, 14, 3, 229-240 (1996).
Shanmuganayagam, V., “Current float techniques for resource scheduling,” Journal of Construction Engineering and Management, ASCE, 115, 3, 401-411 (1989).
Skutella, M., “Approximation algorithms for the discrete time- cost trade-off problem,” Mathematics of Operations Research, 23, 4, 909–929 (1998).
Slowionski, R., “Multi-objective project scheduling under multiple-category resource constraints, in: Slowionski R, WWeglarz J (Eds.),” Advances in project scheduling Amsterdam: Elsevier, 151–167 (1989).
Smith-Daniels, D. E. and V. L. Smith-Daniels, “Optimal project scheduling with materials ordering,” IIE Transactions, 19, 2, 122-129 (1987).
Smith-Daniels, D. E. and Aquilano, N. J. “A formal set of algorithms for project scheduling with critical path scheduling/material requirement planning,” Journal of Operational Management, 1, 2, 57-67 (1987).
Sprecher, A., R. Kolisch and A. Drexl, “Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem,” European Journal of Operational Research, 80, 94–102 (1995).
Sprecher, A. and A. Drexl, “Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm,” European Journal of Operational Research, 107, 2, 431-450 (1998).
Steinberg, E., W. B. Lee and B. M. Khumawala, “A requirements planning system for the space shuttle operations schedule,” Journal of Operational Management, 1, 2, 66-76(1980).
Shi, Y. H. and R. C. Eberhart, “A modified particle swarm optimizer,” In IEEE World Congress on Computational Intelligence, IEEE Press, (1998a).
Shi, Y. and R. C. Eberhart, “Parameter selection in particle swarm optimization,” In Evolutionary Programming VII (Berlin, 1998), pp.591–600 (1998b).
Wagner, H. M. and T. M. Whitin, “Dynamic version of the economic lot size model,” Management Science, 5, 1, pp89-96 (1958).
Wiest, J. D., “The scheduling of large projects with limited resource,” Unpublished Ph.D. Thesis, Carnegie Institute of Technology (1963).
Yang, K. K., F. B. Talbot and J. H. Patterson, “Scheduling a project to maximize its net present value: an integer programming approach,” European Journal of Operational Research, 64, 2, 188-198 (1993).
Zamani, R. and L. Y. Shue, “Solving project scheduling problem with a heuristic learning algorithm,” Journal of the Operational Research Society, 49, 7, 709-716 (1998).
Zhenya, H., Y. L. Chengjian, G. Xiqi, Y. Susu, R. C. Eberhart and Y. Shi, “Extracting Rules from Fuzzy Neural Network by Particle Swarm Optimization,” Proceedings of the IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, 74-77 (1998).