[1] HAN W, CUI Z, GU X. Blocking flow shop based on a new frog leaping algorithm[J]. Journal of East China University of Science and Technology, 2014,40(1):86-90. (韩炜,崔喆,顾幸生.基于新型蛙跳算法的带阻塞流水线调度问题[J].华东理工大学学报,2014,40(1):86-90.) [2] DENG G, XU Z, GU X. A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling[J]. Chinese Journal of Chemical Engineering, 2012,20(6):1067-1073. [3] GRABOWSKI J, PEMPERA J. The permutation flowshop problem with blocking: a tabu search approach[J]. Omega, 2007,35(3):302-311. [4] WANG L, PAN Q-K, TASGETIREN M F. Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms[J]. Expert Systems with Applications, 2010,37(12):7929-36. [5] ZHANG Q, CHEN Y. Hybrid particle swarm optimization algorithm for hybrid flow shop scheduling problem with blocking[J]. Information and Control, 2013,42(2):252-257.(张其亮,陈永生.带有阻塞限制的混合流水车间调度问题的混合粒子群求解算法[J].信息与控制,2013,42(2):252-257.) [6] WANG L. Advances in quantum-inspired evolutionary algorithms[J]. Control and Decision, 2008,23(12):1321-1326.(王凌.量子进化算法研究进展[J].控制与决策,2008,23(12):1321-1326.) [7] LI P, CHAI Y, XIONG Q. Quantum gate Elman neural network and its quantized extended gradient back-propagation training algorithm[J]. Acta Automatica Sinica, 2013,39(9):1511-1522.(李鹏华,柴毅,熊庆宇.量子门Elman神经网络及其梯度扩展的量子反向传播学习算法[J].自动化学报,2013,39(9):1511-1522.) [8] WANG D, CHEN H, ZHU W, et al. Unitary matrix of multiple-valued quantum permutation gate[J]. Chinese Journal of Computers, 2012,35(3):639-644.(王东,陈汉武,朱皖宁,等.多值逻辑量子置换门的酉矩阵表示[J].计算机学报,2012,35(3):639-644.) [9] LIU C, GEN H, LIU W. Secure quantum communication protocol based on symmetric W state and identity authentication[J]. Journal of Computer Applications, 2014,34(2):438-441.(刘超,耿焕同,刘文杰. 基于对称W态和身份认证的安全量子通信协议[J].计算机应用,2014,34(2):438-441.) [10] REN Z, XIONG R, CHU J. Hybrid quantum differential evolutionary algorithm and its applications[J]. Control Theory and Applications, 2011,28(10):1349-1355.(任子武,熊蓉,褚健.混合量子差分进化算法及应用[J].控制理论与应用,2011,28(10):1349-1355.) [11] DRAA A, MESHOUL S, TALBI H, et al. A quantum-inspired differential evolution algorithm for solving the N-queens problem[J]. The International Arab Journal of Information Technology, 2010,7(1):21-27. [12] ZHENG T, YAMASHIRO M. Solving flow shop scheduling problems by quantum differential evolutionary algorithm[J]. International Journal of Advanced Manufacturing Technology, 2010,49:643-662. [13] QI X, WANG H, CHEN F, et al. Improved genetic algorithm for multi-objective of PFSP[EB/OL].[2014-08-02]. http://www.cnki.net/kcms/doi/10.3778/j.issn.1002%A9%5C8331.1310%A9%5C0197.html.(齐学梅,王宏涛,陈付龙,等.求解多目标PFSP问题的改进遗传算法[EB/OL].[2014-08-02]. http://www.cnki.net/kcms/doi/10.3778/j.issn.1002%A9%5C8331.1310%A9%5C0197.html.) [14] QIAN B, WANG L, HU R, et al. A DE-based approach to no-wait flow-shop scheduling[J]. Computers and Industrial Engineering, 2009,57(3):787-805. [15] DAS S, ABRAHAM A, KONAR A. Particle swarm optimization and differential evolution algorithms: technical analysis, applications and hybridization perspectives[J]. Studies in Computational Intelligence, 2008,116:1-38. [16] JARBOUI B, EDDALY M, SIARRY P. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems[J]. Computers and Operations Research, 2009,36(9):2638-2646. [17] TAILLARD E. Benchmarks for basic scheduling programs[J]. European Journal of Operational Research, 1993,64(2):278-285. [18] QI X, LI X, WANG Q. Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime[J]. Journal of Southeast University: Natural Science Edition, 2008,38(6):960-964.(齐学梅,李小平,王茜.最小化总完工时间的流水作业调度混合算法[J].东南大学学报:自然科学版,2008,38(6):960-964.) [19] PAN Q-K, WANG L. Effective heuristics for the blocking flow shop scheduling problem with makespan minimization[J]. Omega, 2012,40(2):218-229. |