[1]
GAREY M R, JOHNSON D S, SETHI R. The complexity of flowshop and job shop cheduling[J].Mathematics of Operations Research,1976,1(2):117-129.
[2]
EBERHART R C, KENNEDY J. A new optimizer using particle swarm theory[EB/OL].[2011-05-01].http://webmining.spd.louisville.edu/Websites/COMB-OPT/FINAL-PAPERS/SwarmsPaper.pdf.
[3]
高尚,杨静宇.求解流水作业调度问题的混合粒子群优化算法[C]// 2006中国控制与决策学术年会论文集. 沈阳:东北大学出版社,2006:1006-1008.
[4]
田野,刘大有.求解流水车间调度问题的混合粒子群算法[J].电子学报,2011,39(5):1087-1093.
[5]
方伟,孙俊, 须文波.一种多样性控制的粒子群优化算法[J].控制与决策,2008,23(8):863-868.
[6]
刘志雄,严新平,赵润军.置换流水车间调度粒子群算法与参数设置分析[J].武汉理工大学学报:交通科学与工程版,2010,34(6):1129-1132.
[7]
SUN KAI, YANG GEN-KE. An effective hybrid optimization algorithm for the flow shop scheduling problem[C]// Proceedings of the 2006 IEEE International Conference on Information Acquisition. [S.l.]:IEEE,2006:1234-1238.
[8]
朱海梅, 吴永萍.一种高速收敛粒子群优化算法[J].控制与决策,2010,25(1):20-24.
[9]
WANG LING, ZHENG DA-ZHONG. A modified evolutionary programming for flow shop scheduling[J]. International Journal of Advanced Manufacturing Technology,2003,22: 522-527.
[10]
乔佩利,马丽丽,郑林.基于改进粒子群算法的车间作业调度问题研究[J].哈尔滨理工大学学报,2011,16(2):35-39.
[11]
CARLIER J. Ordonnancements a contraintes disjonctives [J].Operations Research,1978,12:333-351.
[12]
REEVES C R. A genetic algorithms for flowshop sequencing[J]. Computers and Operation Research,1955,22(1):5-13. |