[1] Li D N, Wang Y. Production scheduling in intercell cooperative production mode. In: Proceedings of the 24th Chinese Control and Decision Conference (CCDC). Taiyuan: IEEE, 2012. 504-506
[2] [2] Garza O, Smunt T L. Countering the negative impact of intercell flow in cellular manufacturing. Journal of Operations Management, 1991, 10(1): 92-118
[3] [3] Johnson D J, Wemmerlov U. Why does cell implementation stop? factors influencing cell penetration in manufacturing plants. Production and Operations Management, 2004, 13(3): 272-289
[4] [4] Li D N, Meng X W, Li M, Tian Y N. An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine. Journal of Intelligent Manufacturing, DOI: 10.1007/s10845-013-0859-2
[5] [5] Mosbah A B, Dao T M. Optimimization of group scheduling using simulation with the meta-heuristic extended great deluge (EGD) approach. In: Proceedings of the 2010 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). Macao: IEEE, 2010. 275-280
[6] [6] Yousef G K, Reza T M, Amir K. Solving a multi-criteria group scheduling problem for a cellular manufacturing system by scatter search. Journal of the Chinese Institute of Industrial Engineers, 2011, 28(3): 192-205
[7] [7] Solimanpur M, Elmi A. A tabu search approach for group scheduling in buffer-constrained flow shop cells. International Journal of Computer Integrated Manufacturing, 2011, 24(3): 257-268
[8] [8] Tang J F, Wang X Q, Kaku I, Yung K L. Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach. Journal of Intelligent Manufacturing, 2009, 21(4): 525-537
[9] [9] Elmi A, Solimanpur M, Topaloglu S, Elmi A. A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers Industrial Engineering. 2011, 61(1): 171-178
[10] Li D N, Wang Y, Xiao G X, Tang J F. Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes. Computers Operations Research, 2013, 40(5): 1207-1223
[11] Burke E K, Hyde M, Kendall G, Ochoa G, zcan E, Woodward J R. A classification of hyper-heuristic approaches. Handbook of Metaheuristics. Berlin: Springer, 2010. 449-468
[12] Burke E K, Gendreau M, Hyde M, Kendall G, Ochoa G, zcan E, Qu R. Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society, 2013, 64(12): 1695-1724
[13] Yang T, Kuo Y, Cho C. A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. European Journal of Operational Research, 2007, 176(3): 1859-1873
[14] Vzquez-Rodrguez J A, Petrovic S. A new dispatching rule based genetic algorithm for the multi-objective job shop problem. Journal of Heuristics, 2010, 16(6): 771-793
[15] Fayad C, Petrovic S. A fuzzy genetic algorithm for real-world job shop scheduling. In: Proceedings of the 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. Bari, Italy: IEA, 2005. 524-533
[16] Li D N, Meng X W, Liang Q Q, Zhao J Q. A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. Journal of Intelligent Manufacturing, DOI: 10.1007/s10845-014-0874-y
[17] Karaboga D. An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report-TR06, Computer Engineering Department, Engineering Faculty, Erciyes University, Turkey, 2005.
[18] Pan Q K, Tasgetiren M F, Suganthan P N, Chua T J. A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 2011, 181(12): 2455-2468
[19] Tasgetiren M F, Pan Q K, Suganthan P N, Chen A H L. A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences, 2011, 181(16): 3459-3475