An Evolutionary Approach Using Fuzzy Greedy Initialization to Permutation Flow-Shop Scheduling with the Makespan Criterion

摘要：

This paper describes a genetic algorithm (GA) for the permutation flow-shop scheduling problem (PFSP) with the makespan criterion. A constructive heuristic is employed to generate an initial population for the proposed GA. Computational experiments using standard benchmark problems indicate that the proposed method is very effective.

关键词： Flow-shop scheduling fuzzy sets genetic algorithms heuristics

作者: K.Sheibani

作者单位: Iran Telecommunication Research Center (ITRC),Tehran,Iran

会议类型: 国际会议

会议名称: 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management(2010年IEEE第17届工业工程与工程管理国际学术会议)

会议地点: 厦门

会议语种:英文

页码: 638-641

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）