期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 196, 期 3, 页码 869-876出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.04.033
关键词
Genetic algorithm; Permutation flowshop; Total flowtime; Scheduling
资金
- National Natural Science Foundation of China [60672092, 60504029]
- National 863 Project [2008AA04Z103]
In this paper, a HGA (hybrid genetic algorithm) is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are known to be NP-hard. One of the chromosomes in the initial population is constructed by a suitable heuristic and the others are yielded randomly. An artificial chromosome is generated by a weighted simple mining gene structure, with which a new crossover operator is presented. Additionally, two effective heuristics are adopted as local search to improve all generated chromosomes in each generation. The HGA is compared with one of the most effective heuristics and a recent meta-heuristic on 120 benchmark instances. Experimental results show that the HGA outperforms the other two algorithms for all cases. Furthermore, HGA obtains 115 best solutions for the benchmark instances, 92 of which are newly discovered. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据