A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem
碩士 === 國立交通大學 === 工業工程與管理系所 === 95 === 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 a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/49662481926523641217 |
| id |
ndltd-TW-095NCTU5031054 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-095NCTU50310542015-10-13T16:13:47Z http://ndltd.ncl.edu.tw/handle/49662481926523641217 A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem 零工式排程之巨集啟發式演算法的比較 Kuang-Pei Lu 呂光棓 碩士 國立交通大學 工業工程與管理系所 95 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. Muh-Cherng Wu 巫木誠 2007 學位論文 ; thesis 54 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立交通大學 === 工業工程與管理系所 === 95 === 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.
|
| author2 |
Muh-Cherng Wu |
| author_facet |
Muh-Cherng Wu Kuang-Pei Lu 呂光棓 |
| author |
Kuang-Pei Lu 呂光棓 |
| spellingShingle |
Kuang-Pei Lu 呂光棓 A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| author_sort |
Kuang-Pei Lu |
| title |
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| title_short |
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| title_full |
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| title_fullStr |
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| title_full_unstemmed |
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem |
| title_sort |
comparison of meta-heuristics algorithms for job shop scheduling problem |
| publishDate |
2007 |
| url |
http://ndltd.ncl.edu.tw/handle/49662481926523641217 |
| work_keys_str_mv |
AT kuangpeilu acomparisonofmetaheuristicsalgorithmsforjobshopschedulingproblem AT lǚguāngbàng acomparisonofmetaheuristicsalgorithmsforjobshopschedulingproblem AT kuangpeilu línggōngshìpáichéngzhījùjíqǐfāshìyǎnsuànfǎdebǐjiào AT lǚguāngbàng línggōngshìpáichéngzhījùjíqǐfāshìyǎnsuànfǎdebǐjiào AT kuangpeilu comparisonofmetaheuristicsalgorithmsforjobshopschedulingproblem AT lǚguāngbàng comparisonofmetaheuristicsalgorithmsforjobshopschedulingproblem |
| _version_ |
1717769998097711104 |