Scheduling algorithm based on evolutionary computing in identical parallel machine production line

被引:32
|
作者
Liu, M [1 ]
Wu, C [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Natl CIMS Engn Res Ctr, Beijing 100084, Peoples R China
关键词
parallel machine production line; scheduling algorithms; evolutionary programming; evolutionary fine-tuning; heuristic procedure; GENETIC ALGORITHMS; TUTORIAL SURVEY; FUTURE;
D O I
10.1016/S0736-5845(03)00041-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Evolutionary programming is a kind of evolutionary computing method based on stochastic search suitable for solving system optimization. In this paper, evolutionary programming method is applied to the identical parallel machine production line scheduling problem of minimizing the number of tardy jobs, which is a very important optimization problem in the field of research on CIMS and industrial engineering, and researches on problem formulation, expression of feasible solution, methods for the generation of the initial population, the mutation and improvement on the local search ability of evolutionary programming. Computational results of different scales of problems show that the evolutionary programming algorithm proposed in this paper is efficient, and that it is fit for solving large-scale identical parallel machine production line scheduling problems, and that the quality of its solution has advantage over so far the best heuristic procedure. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:401 / 407
页数:7
相关论文
共 50 条