Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm
The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 出版事項: |
2015
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/59479/ http://dx.doi.org/10.1063/1.4915695 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|