零工式排程之巨集啟發式演算法的比較

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	呂光棓	en_US
dc.contributor.author	Kuang-Pei Lu	en_US
dc.contributor.author	巫木誠	en_US
dc.contributor.author	Muh-Cherng Wu	en_US
dc.date.accessioned	2014-12-12T03:07:56Z	-
dc.date.available	2014-12-12T03:07:56Z	-
dc.date.issued	2006	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#GT009433543	en_US
dc.identifier.uri	http://hdl.handle.net/11536/81654	-
dc.description.abstract	零工式排程問題(Classical Job Shop Scheduling Problem；JSSP)是一個已經研究很久的問題，也已有許多文獻發表，目前以Huang & Liao (2006)的演算法表現最佳。本研究結合共識因子和田口方法提出多種巨集演算法(meta-heuristics)，希望找出一種演算法，能在績效上改進Huang & Liao (2006)的演算法。本研究使用19個案例實驗測試，贏了5個(26%)，平手7個(37%)，輸了7個(37%)。	zh_TW
dc.description.abstract	The classical job shop scheduling problem (JSSP) has been studied for decades. Much literature has been published, and the algorithm proposed by Huang & Liao (2006) is the most leading one. We applied the notions of consensus and Taguchi genetic operators and proposed various meta-heuristics algorithms. Numerical tests that include 19 problem instances have been carried out. Compared with the algorithm proposed by Huang & Liao (2006), our algorithm excel in 5 problem instances, and has a tie in 7 problem instances, and lose in 7 problem instances.	en_US
dc.language.iso	zh_TW	en_US
dc.subject	共識因子	zh_TW
dc.subject	田口方法	zh_TW
dc.subject	禁忌搜尋法	zh_TW
dc.subject	瓶頸飄移法	zh_TW
dc.subject	零工式排程	zh_TW
dc.subject	consensus operator	en_US
dc.subject	Taguchi methods	en_US
dc.subject	Taboo search	en_US
dc.subject	shift bottleneck procedure	en_US
dc.subject	Job shop schedulin	en_US
dc.title	零工式排程之巨集啟發式演算法的比較	zh_TW
dc.title	A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem	en_US
dc.type	Thesis	en_US
dc.contributor.department	工業工程與管理學系	zh_TW
顯示於類別：	畢業論文

文件中的檔案：

354301.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。