Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem

被引：0

作者：

Bozejko, Wojciech ^{[1
]}

Uchronski, Mariusz ^{[1
]}

Wodecki, Mieczyslaw ^{[1
]}

机构：

[1] Wroclaw Univ Technol, Inst Comp Engn Control & Robot, PL-50372 Wroclaw, Poland

来源：

ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II | 2013年 / 7895卷

关键词：

GENETIC ALGORITHM; TARDINESS;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We propose two parallel algorithms based on neuro-tabu search method, designed to solve the jobs shop problem of scheduling. The fist algorithm is based on independent runs of the neuro-tabu with different starting points. The second one uses sophisticated diversification method based on path-relinking methodology applied to the set of elite solutions. Proposed approaches are especially effective for the instances of large size.

引用

页码：489 / 499

页数：11

共 35 条

[1] Alba E, 2005, WILEY SER PARA DIST, P1, DOI 10.1002/0471739383
[2] [Anonymous], 1995, MYTHICAL MAN MONTH
[3] [Anonymous], 1993, NETWORK OPTIMIZATION
[4] Tabu search for minimizing total tardiness in a job shop
Armentano, VA
Scrich, CR
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 63 (02) : 131 - 140
[5] Bolejko W, 2010, LECT NOTES ARTIF INT, V6114, P387, DOI 10.1007/978-3-642-13232-2_47
[6] Bozejko W., 2012, P 14 INT AS PAC C CO
[7] Bozejko W., 2010, NEW CLASS PARALLEL S, P1
[8] On single-walk parallelization of the job shop problem solving algorithms
Bozejko, Wojciech
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2258 - 2264
[9] Bozejko W, 2010, LECT NOTES ARTIF INT, V6114, P395, DOI 10.1007/978-3-642-13232-2_48
[10] Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073

← 1 2 3 4 →