期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2009
卷号:9
期号:5
页码:51-58
出版社:International Journal of Computer Science and Network Security
摘要:In this paper, an improved genetic algorithm is proposed for flow shop scheduling problems. The proposed method is improved by��Lagrangian relaxation method using multipliers which can be adjusted during the search process. The simulation results based on some flow shop problems prove the proposed method can find better solution than original guided genetic algorithm.