A genetic-algorithm-based optimization model for scheduling flexible assembly lines

被引:42
作者
Guo, Z. X. [1 ]
Wong, W. K. [1 ]
Leung, S. Y. S. [1 ]
Fan, J. T. [1 ]
Chan, S. F. [1 ]
机构
[1] Hong Kong Polytech Univ, Inst Textiles & Clothing, Kowloon, Hong Kong, Peoples R China
关键词
scheduling; bi-level genetic algorithm; flexible assembly line;
D O I
10.1007/s00170-006-0818-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a scheduling problem in the flexible assembly line (FAL) is investigated. The mathematical model for this problem is presented with the objectives of minimizing the weighted sum of tardiness and earliness penalties and balancing the production flow of the FAL, which considers flexible operation assignments. A bi-level genetic algorithm is developed to solve the scheduling problem. In this algorithm, a new chromosome representation is presented to tackle the operation assignment by assigning one operation to multiple machines as well as assigning multiple operations to one machine. Furthermore, a heuristic initialization process and modified genetic operators are proposed. The proposed optimization algorithm is validated using two sets of real production data. Experimental results demonstrate that the proposed optimization model can solve the scheduling problem effectively.
引用
收藏
页码:156 / 168
页数:13
相关论文
empty
未找到相关数据