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: | Kuang-Pei Lu, 呂光棓 |
---|---|
Other Authors: | Muh-Cherng Wu |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/49662481926523641217 |
Similar Items
-
A Comparison of Meta-heuristics Algorithms for the Hybrid Flow Shop Scheduling Problem
by: Zhong-Lin Li, et al.
Published: (2007) -
A New Heuristic Method for Job-Shop Scheduling Problem
by: Liu, Kuang-Ping, et al.
Published: (2002) -
A hybrid meta-heuristic algorithm for dual resource constrained flexible job shop scheduling problem
by: Reza Tavakkoli-Moghaddam, et al.
Published: (2015-01-01) -
Heuristics for job-shop scheduling
by: Pasch, Kenneth Alan
Published: (2005) -
An Efficient Meta-Heuristic for Multi-Objective Flexible Job Shop Inverse Scheduling Problem
by: Rui Wu, et al.
Published: (2018-01-01)