|  Andersson M. Industrial scheduling with evolutionary algorithms using a hybrid representation[D]. Skövde:The University of Skövde,2011. Chen B O, Lee C. Logistics scheduling with batching and transportation[J]. European Journal of Operational Research, 2013, 189(3): 871-876. Li Bin, LI Wenfeng. Container terminal logistics systems collaborative scheduling based on multi-agent systems[J]. Computer Integrated Manufacturing Systems, 2011, 17(11): 2502-2514(in Chinese). Wu C L. Inherent delays and operational reliability of airline schedules[J]. Journal of Air Transport Management, 2005, 11(4): 273-282. Zhang Qiqian, Hu Minghua, Shi Saifeng, et al. Optimization algorithm of flight takeoff and landing on multi-runways[J]. Journal of Traffic and Transportation Engineering, 2012, 12(06): 63-68(in Chinese). Yuan Wanghong, Nahrstedt K. Energy-efficient soft real-time cpu scheduling for mobile multimedia systems[J]. ACM SIGOPS Operating Systems Review, 2003, 37(5): 149-163. Chen Jie. GPU/CPU isomerism system energy saving task scheduling method simulation[J]. Computer Simulation, 2013, 30(07): 235-238(in Chinese). Yenisey M M, Yagmahan B. Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends[J]. Omega, 2014, 45: 119-135. Zhang Xianchao, Zhou Hong. Variable parameters quantum-inspired evolutionary algorithm and its application in permutation flow-shop scheduling problem[J]. Computer Integrated Manufacturing Systems, 2016, 22(3): 774-781(in Chinese). Yao Yuanyuan,Ye Chunming, Liu Yutai. Cuckoo search algorithm for the permutation flow-shop scheduling problem with learning effect[J]. Mathematical Theory and Applications, 2015, 35(2): 47-55(in Chinese). Zhang Yu, Li Wenfeng, Robert H S, et al. Mathematic modeling and heuristic algorithm of hybrid flow shop with multi-jobs families and no-buffer[J]. Systems Engineering-Theory & Practice, 2013, 33(8): 2116-2124(in Chinese). Zhang Qiliang, Chen Yongsheng. Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem[J]. Systems Engineering-Theory & Practice, 2014, 34(3): 802-809(in Chinese). Wall M B. A genetic algorithm for resource-constrained scheduling[D].Massachusetts: Massachusetts Institute of Technology,1996. Li Tieke, Su Zhixiong. Two-stage genetic algorithm for SM-CC production scheduling[J]. Chinese Journal of Management Science, 2009, 17(05): 68-74(in Chinese). Zhou Shuiyin, Liu Yanfeng. Study on scheduling of whole-set orders under flow-shop with service level constraints[J]. Chinese Journal of Management Science, 2009, 17(04): 69-74(in Chinese). Hao Xinchang, Lin Lin, Gen M, et al. Effective estimation of distribution algorithm for stochastic job shop scheduling problem[J]. Procedia Computer Science, 2013, 20: 102-107. Reza H, Saghafian S S. Flow shop-scheduling problems with makespan criterion: A review[J]. International Journal of Production Research, 2005, 43(14): 2895-2929. Sangkavichitr C, Chongstitvatana P. Block as a small evidence of the building blocks existence[M]//Chen Yingping. Exploitation of Linkage Learning in Evolutionary Algorithms,Berlin Heidelberg:Springer, 2010: 25-44. Ruiz R, Maroto C, Alcaraz J. Two new robust genetic algorithms for the flow shop scheduling problem[J]. Omega, 2006, 34(5): 461-476. Chang P C, Chen Menghui, Tiwari M K, et al. A block-based evolutionary algorithm for flow-shop scheduling problem[J]. Applied Soft Computing, 2013, 13(12): 4536-4547. Chen Menghui, Chang P C, Tiwari A, et al. Bi-variance estimation of distribution model to generate block[J]. World Academy of Science, Engineering & Technology, 77, 2013. Agrawal R, Imieliński T, Swami A. Mining association rules between sets of items in large databases[J]. ACM SIGMOD Record, 1993, 22(2): 207-216. Sarath K, Ravi V. Association rule mining using binary particle swarm optimization[J]. Engineering Applications of Artificial Intelligence, 2013, 26(8): 1832-1840. McNicholas P D, Murphy T B, O'Regan M. Standardising the lift of an association rule[J]. Computational Statistics & Data Analysis, 2008, 52(10): 4712-4721. Taillard E. Benchmarks for basic scheduling problems[J]. European Journal of Operational Research, 1993, 64(2): 278-285. Chen S H, Chang P C, Cheng T C E, et al. A self-guided genetic algorithm for permutation flow shop scheduling problems[J]. Computers & Operations Research, 2012, 39(7): 1450-1457.