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 |