An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems

被引：45

作者：

Marichelvam, M. K. ^{[1
]}

机构：

[1] Kamaraj Coll Engn & Technol, Dept Mech Engn, Virudunagar 626001, Tamil Nadu, India

来源：

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION | 2012年 / 4卷 / 04期

关键词：

flow shop; scheduling; makespan; non-deterministic polynomial time hard; NP-hard; heuristics; metaheuristics; improved hybrid Cuckoo Search; IHCS; PARTICLE SWARM OPTIMIZATION;

D O I：

10.1504/IJBIC.2012.048061

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one important type of scheduling problems for the past several decades. Flow shop scheduling problems are non-deterministic polynomial time hard (NP-hard) problems. Hence the exact methods can not be used to solve these problems. Many heuristics and metaheuristics were addressed in the literature to solve the flow shop scheduling problems. Cuckoo Search is a recently developed metaheuristics algorithm. The efficiency of the algorithm may decrease as the parameters of the Cuckoo Search are constant. Hence an improved hybrid Cuckoo Search (IHCS) algorithm is developed in the present work to solve the permutation flow shop scheduling problems. The proposed algorithm has been implemented for some benchmark problems in the literature and the results are compared with some other metaheuristics algorithms.

引用

页码：200 / 205

页数：6

共 27 条

[1]

Baker K. R., 1974, Introduction to Sequencing and Scheduling"

[2]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

[3] EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].

DANNENBRING, DG .

MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182

[4] Benchmarks for shop scheduling problems [J].

Demirkol, E ;

Mehta, S ;

Uzsoy, R .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (01) :137-141

[5]

Dhivja M., 2011, International J. Communications, P249, DOI DOI 10.4236/IJCNS.2011.44030

[6] A scatter search approach for general flowshop scheduling problem [J].

Haq, A. Noorul ;

Saravanan, M. ;

Vivekraj, A. R. ;

Prasad, T. .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (7-8) :731-736

[7]

Johnson S.M., 1954, NAVAL RES LOGISTICS, V1, P61, DOI [DOI 10.1002/NAV.3800010110, 10.1002/nav.3800010110]

[8] An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model [J].

Kuo, I-Hong ;

Horng, Shi-Jinn ;

Kao, Tzong-Wann ;

Lin, Tsung-Lieh ;

Lee, Cheng-Ling ;

Terano, Takao ;

Pan, Yi .

EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) :7027-7032

[9] An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines [J].

Lei, Deming ;

Wang, Tao .

COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) :739-743

[10] A discrete version of particle swarm optimization for flowshop scheduling problems [J].

Liao, Ching-Jong ;

Tseng, Chao-Tang ;

Luarn, Pin .

COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) :3099-3111

← 1 2 3 →