华东理工大学学报：自然科学版2012，Vol.38Issue(1)：89-94,6.
用AGLA算法求解一类以TFT为目标的模糊Flow Shop调度问题
An Asynchronous Genetic Local-Search Algorithm with Total Flow Time Criterion for Fuzzy Flow Shop Scheduling Problem
王雪 1郭丙君2
作者信息
- 1. 华东理工大学信息科学与工程学院,上海200237
- 2. 华东理工大学信息科学与工程学院,上海200237／石河子大学信息科学与技术学院,新疆石河子832003
- 折叠
摘要
Abstract
With the objective of total flow time, the permutation flow shop scheduling problem is discussed in this paper. The uncertain processing time is described by fuzzy mathematics. Furthermore, an improved genetic algorithm, asynchronous genetic local-search algorithm （AGLA）, is presented. In AGLA, an individual in the initial population is generated by a constructive heuristic method, and the others are randomly yielded. And then, by an enhanced variable neighborhood search strategy and a crossover operator, the asynchronous evolution is executed for each pair of individuals. Besides, a restart strategy is employed to avoid the problem of local minimum. Finally, numerical simulation results show the effectiveness of the AGLA for fuzzy flow shop scheduling problem.关键词
总流经时间/异步遗传局部搜索算法/不确定性：Flow/Shop调度Key words
total flow time/asynchronous genetic local-search algorithm/uncertainty/flow shop scheduling分类
计算机与自动化引用本文复制引用
王雪,郭丙君..用AGLA算法求解一类以TFT为目标的模糊Flow Shop调度问题[J].华东理工大学学报：自然科学版,2012,38(1):89-94,6.
