書誌事項
- タイトル別名
-
- A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem
- ニモクテキ フローショップ スケジューリング モンダイ ニ タイスル イデンテ
この論文をさがす
抄録
In this paper, we consider a bicriteria two-machine flow-shop scheduling problem which is to simultaneously minimize both Cmax and Tmax criteria, and we propose a new genetic algorithm for enumerating all nondominated solutions for this problem. Our algorithm is constructed by incorporating several existing strategies developed for multi-objective optimization problems together with a new strategy which we call seeding strategy that seeds some good individuals in the initial population. We perform computational experiments in order to compare our algorithm with other existing methods.We observe from our computational results that our algorithm produces nondominated solutions very close to exact ones, and outperforms other existing heuristics.
収録刊行物
-
- システム制御情報学会論文誌
-
システム制御情報学会論文誌 10 (3), 127-136, 1997
一般社団法人 システム制御情報学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001205164758272
-
- NII論文ID
- 10004331739
-
- NII書誌ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL書誌ID
- 4159100
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可