ロボティクス・メカトロニクス講演会講演概要集
Online ISSN : 2424-3124
セッションID: 1A1-L03
会議情報
1A1-L03 JSPに対する遺伝的アルゴリズムと割付け規則に基づく近似解法の提案(進化・学習とロボティクス)
田村 康将飯塚 博幸山本 雅人
著者情報
会議録・要旨集 フリー

詳細
抄録
The job-shop scheduling problem (JSP) is one of the combinatorial optimizations and one of the most difficult order decision problems. Many approximate algorithms, which are heuristic methods or metaheuristics, are studied to solve JSP, because JSP is categorized into NP-hard problems. The application of the dispatching rules is known as a practical heuristic for JSP or many other scheduling problems. This study proposes an extended algorithm for JSP based on the genetic algorithm and a novel local search method using the dynamic dispatching rules. The extended algorithm searches for effective dispatching rules along with schedules according to the genetic algorithm. Also the schedules are partially modified by the rules in every generation. In order to verify the effectiveness of the proposed algorithm, this paper shows the result of numerical experiments.
著者関連情報
© 2014 一般社団法人 日本機械学会
前の記事 次の記事
feedback
Top