An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time

被引:136
作者
Xu, Ye [1 ]
Wang, Ling [1 ]
Wang, Sheng-yao [1 ]
Liu, Min [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Tsinghua Natl Lab Informat Sci & Technol TNList, Beijing 10084, Peoples R China
基金
中国国家自然科学基金;
关键词
Flexible job-shop scheduling problem; Fuzzy processing time; Teaching-learning-based optimization; Taguchi method; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; PARAMETER OPTIMIZATION; DESIGN;
D O I
10.1016/j.neucom.2013.10.042
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, an effective teaching-learning-based optimization algorithm (TLBO) is proposed to solve the flexible job-shop problem with fuzzy processing time (FJSPF). First, a special encoding scheme is used to represent solutions, and a decoding method is employed to transfer a solution to a feasible schedule in the fuzzy sense. Second, a bi-phase crossover scheme based on the teaching-learning mechanism and special local search operators are incorporated into the search framework of the TLBO to balance the exploration and exploitation capabilities. Moreover, the influence of the key parameters on the TLBO is investigated using the Taguchi method. Finally, numerical results based on some benchmark instances and the comparisons with some existing algorithms are provided. The comparative results demonstrate the effectiveness and efficiency of the proposed TLBO algorithm in solving the FJSPF. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:260 / 268
页数:9
相关论文
共 33 条
[1]   A variable neighbourhood search algorithm for the flexible job-shop scheduling problem [J].
Amiri, M. ;
Zandieh, M. ;
Yazdani, M. ;
Bagheri, A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (19) :5671-5689
[2]   A REVIEW OF SOME METHODS FOR RANKING FUZZY SUBSETS [J].
BORTOLAN, G ;
DEGANI, R .
FUZZY SETS AND SYSTEMS, 1985, 15 (01) :1-19
[3]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[4]   JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES [J].
BRUCKER, P ;
SCHLIE, R .
COMPUTING, 1990, 45 (04) :369-375
[5]   An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306
[6]   A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems [J].
Gao, Jie ;
Sun, Linyan ;
Gen, Mitsuo .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2892-2907
[7]   A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty [J].
Gonzalez-Rodriguez, Ines ;
Vela, Camino R. ;
Puente, Jorge .
JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (01) :65-73
[8]   An effective architecture for learning and evolving flexible job-shop schedules [J].
Ho, Nhu Binh ;
Tay, Joc Cing ;
Lai, Edmund M. -K. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) :316-333
[9]   A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm [J].
Hu, Yanmei ;
Yin, Minghao ;
Li, Xiangtao .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (9-12) :1125-1138
[10]  
Krishnanand KR, 2011, LECT NOTES COMPUT SC, V7076, P697