Random and evolution algorithms of the tasks scheduling and of the production scheduling

被引:0
|
作者
Witkowski, T [1 ]
Antczak, A [1 ]
Antczak, P [1 ]
机构
[1] Warsaw Univ Technol, Fac Prod Engn, Warsaw, Poland
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper presents contemporary artificial intelligence tools - evolution algorithms and random algorithms designed for the optimalisation of the production scheduling problem for multi-assortment short-series production. The essential idea of SZEZA method has been presented. SZEZA method has the ability of part control of the sequence of tasks. The efficiency of SZEZA has been compared with the efficiency of genetic algorithm AGHAR and with efficiency of other metaheuristic methods. Problems related with the further development of mentioned algorithms for the purpose of a choice and defining their optimal decision factors and constraints have been described.
引用
收藏
页码:727 / 732
页数:6
相关论文
共 50 条