Genetic Algorithm-Based Minimization of Weighted Completion Time of Parallel Multi-Machine Scheduling

摘要：

In order to solve a kind of identical and non-identical parallel machine scheduling problems for minimization of the total weighted completion time, a genetic algorithm with a new extended representation encoding is proposed. The new encoding representation has problem-specific features, with coding mapping out a scheduling plan one to one and fitting multi-cross operators. Results from numerical calculation show that genetic algorithm with the proposed encoding in this paper is encouraging and can be used to deal with large-scale identical and non-identical parallel machine scheduling problems. A comparison with Cheng s encoding is made, showing an easy operation and a fast convergence of the proposed coding in this paper.

关键词： Genetic Algorithm Encoding Parallel Machine Scheduling Minimization Weighted Completion Time

作者: Zhou Huiren Zheng Pi-e Wang Hailong

作者单位: Institute of Systems Engineering, Tianjin University,Tianjin P.R.China, 300072

会议类型: 国际会议

会议名称: 第十四届工业工程与工程管理国际会议(The Proceedings of The 14th International Conference on Industrial Engineering and Engineering Management IE&EM2007)

会议地点: 天津

会议语种:英文

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