Solving No-Wait Flow Shop Scheduling Problems by a Hybrid Quantum-Inspired Evolutionary Algorithm

被引:0
作者
Zheng, Tianmin [1 ]
Yamashiro, Mitsuo [1 ]
机构
[1] SoftAgency Co Ltd, Oyama, Tochigi 3230824, Japan
来源
ADVANCES IN SOFT COMPUTING - MICAI 2010, PT II | 2010年 / 6438卷
关键词
quantum-inspired evolutionary algorithm; no-wait; permutation flow shop; differential operation; local search; PARTICLE SWARM OPTIMIZATION; MAKESPAN CRITERION; MINIMIZE MAKESPAN; GENETIC ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper is the first to consider the hybrid quantum-inspired evolutionary algorithm (HQEA) on the no-wait permutation flow shop scheduling problem (PFSP) for minimizing the makespan. In this HQEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple but efficient converting mechanism for determining job sequence is proposed for the representation of solution firstly. Then, we adopt differential operation to perform the updating of quantum gate and the local search to perform exploitation in the promising permutation-based solutions. We make the simulations on famous benchmarks and the comparisons with other state-of-the-art approaches demonstrate the effectiveness of the proposed HQEA for no-wait flow shop scheduling problem.
引用
收藏
页码:315 / 324
页数:10
相关论文
共 16 条
[1]   New heuristics for no-wait flowshops to minimize makespan [J].
Aldowaisan, T ;
Allahverdi, A .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) :1219-1231
[2]  
CARLIER J, 1978, RAIRO-RECH OPER, V12, P333
[3]   Some local search algorithms for no-wait flow-shop problem with makespan criterion [J].
Grabowski, J ;
Pempera, J .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) :2197-2212
[4]  
Gu J., 2008, P 17 IFAC WORLD C, P63
[5]  
Han K. H., 2002, IEEE T EVOLUTIONARY
[6]   A constructive heuristic for minimizing makespan in no-wait flow shop scheduling [J].
Laha, Dipak ;
Chakraborty, Uday K. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2) :97-109
[7]   An effective hybrid particle swarm optimization for no-wait flow shop scheduling [J].
Liu, Bo ;
Wang, Ling ;
Jin, Yi-Hui .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (9-10) :1001-1011
[8]  
Niu Q, 2009, J UNIVERS COMPUT SCI, V15, P765
[9]   A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, M. Fatih ;
Liang, Yun-Chia .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2807-2839
[10]  
RAJENDRAN C, 1994, J OPER RES SOC, V45, P472, DOI 10.2307/2584218