207 効率的なアクティブスケジュール探索法(OS2.生産管理・スケジューリングおよびサプライチェーン(2))

• 江口 透

  広島大学

• 飯尾 崇晃

  広島大学

• 村山 長

  広島大学

書誌事項

タイトル別名

• 207 An Efficient Search Method for Active Schedule

抄録

This paper proposes an efficient optimization method for job shop scheduling. Optimum schedules with regard to regular objective functions such as tardiness of jobs exist in the set of active schedules. Active schedules may insert idle times when machines became idle and there are waiting jobs. This decision of inserting idle times is difficult when searching optimum schedules. In the proposed method, the job which arrives a machine earlier is set to have a higher priority value using a weight value to avoid making the machine idle long time. Furthermore, when an idle time is inserted, the time length is considered when calculating priority values of jobs. Numerical experiments show the effectiveness of the proposed method by comparing it with the method using a look-ahead parameter.

収録刊行物

• 生産システム部門講演会講演論文集

  生産システム部門講演会講演論文集 2016 67-68, 2016-03-11

  一般社団法人日本機械学会

キーワード

• Job shop scheduling
• Active schedule
• Non-delay schedule
• Genetic algorithm
• Priority rule

詳細情報

• CRID: 1572543027366646656
• NII論文ID: 110010051088
• NII書誌ID: AA11903029
• 本文言語コード: ja
• データソース種別:
  • CiNii Articles