森林火災常帶來嚴重的損害。本論文模擬森林火災情境，設計出最佳的滅火排程，使火災的損失最少。
我們將災區規劃為一n×n方陣，每次調派一架直昇機依「行向」或「列向」直飛噴灑滅火物，每次滅一行(或一列)需花費1個單位時間，每個區塊僅需執行一次，即能完成滅火任務；若未能在迫切時間aij內撲滅，將造成1個單位的損失。這是個計算複雜度為NP-hard的問題，我們設計了一個「中間分段」之動態規劃演算法來找出森林滅火問題的最佳解，並撰寫電腦程式透過計算機模擬計算，探討此演算法較一般窮舉法能降低更多演算次數。

Forest fire often causes great damage. In order to diminish the loss by the fire, this paper simulates the situation of forest fire, and attempts to design optimal fire extinguishing task scheduling.
We regard the disaster area as an n×n square matrix. A helicopter is arranged to sprinkle fire-extinguishing chemicals either through a line or a row. It takes one unit of time to deal with a line or a row. Each unit requires only one action. Each unit can be totally put out the fire. If we fail to put out the fire within the urgent time aij, we will lose a unit of damage. This belongs to be a strongly NP-hard problem. A dynamic programming algorithms segmenting from the middle of fire-extinguishment are presented, utilizing computerized programs to simulate the calculations. The improvement intensity of this algorithm performing can lessen more frequency for performing a Brute force attack.

[1] 郭寶章(民 94)。森林的功能與保育。科學發展期刊，第388期，6-13。
[2] 黃翰仁（民 92）。重要參數對森林火災影響研究。元智大學機械工程學系碩士論文。
[3] 張獻仁（民 87）。森林火災防救實務問題之研究--以台灣省林務局為例。國立中興大學森林學系碩士論文。
[4] Frederick S.Hiller and Gerald J.Lieberman(2006). Introduction to operations research.chapter 13.(潘昭賢、葉瑞徽 譯(2006)。作業研究。滄海書局，第十三章)
[5] 吳泰熙、張欽智(1997)。以禁忌搜尋法則求解推銷員旅行問題。大葉學報，第六卷，第一期，87-99。
[6] Knox. J.(1994). Tabu search performance on the symmetric TSP. Computers ＆ Operations Research,21(8), 786-802.
[7] H. Curt (1995). The Devil’s in the Detail：Techniques, Tools, and Applications for Database mining and Konwlegde Discovery-Part 1 . Intelligent Software Strategies, Vol. 6, no.9, pp.3.
[8] 蔡淑燕(民 91)。運用多區間動態規劃於選題策略之研究。國立臺南大學資訊教育研究所碩士論文，台南市。
[9] Pinedo, M.(1994). Scheduling Theory, Algorithms, and Systems. Prentice Hall, London, 1-32.
[10] Peter B. and Sigrid K(1994). Complexity results for scheduling problems.
http://www.mathematik.uni-osnabrueck.de/research/OR/class/。
[11] Lageweg‚ B. J.‚ Lenstra‚ J. K.‚ Lawler‚ E. L.‚ and Rinnooy Kan‚ A. H. G (1982). Computer-Aided complexity classification of combinational problems. Communications of the ACM‚ Vol. 25, 817-822.
[12] 蔡郁彬、胡繼陽、侯玉展(2008)。演算法概論。學貫行銷股份有限公司，台北，1-15。
[13] 曾志鴻(民 92)。排序演算法之研究。大同大學應用數學研究所碩士論文。
[14] 唐桓永、趙傳立(民 91)。排序引論。科學出版社，北京，234-239。
[15] 江南波。問題的難與易―介紹NP完備的概念。數學傳播期刊，第九十三卷，第三期。
[16] Manindra Agrawal, neeraj Kitin, and Nitin Saxena(2004). PRIMES is in P. Annals of Mathematics, Vol.160, no.2, 781-793.
[17] B.J. Lageweg‚ E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1981): Computer aided complexity classification of deterministic scheduling problems, Report BM 138, Centre for Mathematics and Computer Science.
[18] S. A. Cook(1971). The complexity of theorem proving procedures. Proceedings third Annual ACM Symposium on the Theory of Computing, 151-158.
[19] Goodrich‚ Michael T.‚ Tamassia‚ Roberto(2001). Algorithm Design：Foundations Analysis and Internet Examples. John Wiley‚ New York‚ 592-642.