- 著者
- 江口 透 山本 悠介 與田 光伸 村山 長
- 出版者
- 一般社団法人 日本機械学会
- 雑誌
- 生産システム部門講演会講演論文集 2013 (ISSN:24243108)
- 巻号頁・発行日
- pp.31-32, 2013-03-11 (Released:2017-06-19)
We have already proposed a job shop scheduling method to meet due-dates and to minimize overtime as far as possible. The sequence of operations of jobs is determined using the mixture of genetic algorithm and priority rule. In this report, we evaluate the performance of the proposed method by comparing it with lower bounds solved using a Lagrangian relaxation method. Numerical experiments show that the performance of the proposed method depends on the scale of problem and resolution time.