ジョブショップスケジューリング問題に対する遺伝的アルゴリズムの適用
スポンサーリンク
概要
- 論文の詳細を見る
The job-shop scheduling problem (JSP) is known as one of the most difficult NP-hard problems. Genetic algorithm is effective for solving JSP. But, if a problem is large-scale, it is difficult to solve efficiently in short time. This paper presents a distributed genetic algorithm for solving the JSP. The subpopulation size is four in this algorithm. We present a method can produce suboptimal solutions at a high speed for Fisher's and Thompson's 10×10 benchmark problem.
- 2005-12-20
論文 | ランダム
- Observation and analysis of scattering interaction between a shock wave and a vortex ring
- 三次元境界層における点源撹乱からの乱流遷移, Part II : 定常初期撹乱
- 三次元境界層における点源撹乱からの乱流遷移 Part I. 非定常撹乱
- 三次元境界層における横流れと流線曲率不安定波の分散的発達
- Mechanism of Self-Induced Vibration of a Liquid Drop Based on the Surface Tension Fluctuation