An Improved Teaching-Learning-Based Optimization Algorithm to Solve Job Shop Scheduling Problems

被引：0

作者：

Li, Linna ^{[1
]}

Weng, Wei ^{[1
]}

Fujimura, Shigeru ^{[1
]}

机构：

[1] Waseda Univ, Grad Sch Informat Prod & Syst, Wakamatsu Ku, 2-7 Hibikino, Kitakyushu, Fukuoka 8080135, Japan

来源：

2017 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2017) | 2017年

关键词：

job shop scheduling; teaching-learning-based optimization algorithm; optimization;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Job shop scheduling problem (JSP) is a strongly NP-hard combinatorial optimization problem. It is difficult to solve the problem to the optimum in a reasonable time. Teaching-learning-based optimization (TLBO) algorithm is a novel population oriented meta-heuristic algorithm. It has been proved that TLBO has a considerable potential when compared to the best-known heuristic algorithms for scheduling problems. In this paper, the traditional TLBO is improved to enhance diversification and intensification when exploring solutions for JSP. The improvements include changing the coding method, increasing number of teachers, introducing new learners and performing local search around potentially optimal solutions. To show effectiveness of the improved TLBO algorithm, the simulation results obtained by the improved TLBO for benchmark problems are compared with results obtained by the traditional TLBO and the best known lower bounds.

引用

页码：797 / 801

页数：5

共 12 条

[1]

[Anonymous], 2011, INT J IND ENG COMP

[2] Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases [J].

Baykasoglu, Adil ;

Hamzadayi, Alper ;

Kose, Simge Yelkenci .

INFORMATION SCIENCES, 2014, 276 :204-218

[3] OR-LIBRARY - DISTRIBUTING TEST PROBLEMS BY ELECTRONIC MAIL [J].

BEASLEY, JE .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (11) :1069-1072

[4] A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM [J].

BRUCKER, P ;

JURISCH, B ;

SIEVERS, B .

DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :107-127

[5]

Fisher H, 1963, IND SCHEDULING, P225

[6] An evolutionary membrane algorithm for global numerical optimization problems [J].

Han, Min ;

Liu, Chuang ;

Xing, Jun .

INFORMATION SCIENCES, 2014, 276 :219-241

[7]

Lawrence S.., 1984, GSIA

[8] A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan [J].

Lian, Zhigang ;

Gu, Xingsheng ;

Jiao, Bin .

APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) :773-785

[9] Scheduling flow shops using differential evolution algorithm [J].

Onwubolu, G ;

Davendra, D .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (02) :674-692

[10] Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems [J].

Rao, R. V. ;

Savsani, V. J. ;

Vakharia, D. P. .

INFORMATION SCIENCES, 2012, 183 (01) :1-15

← 1 2 →