Glover, F. and Kochenberger, G.A. (2003) Handbook of Metaheuristics. Kluwer Academic Publishers.
 Duman, E., Uysal, M. and Alkaya, A.F. (2012) Migrating Birds Optimization: A New Metaheuristic Approach and Its Performance on Quadratic Assignment Problem. Information Sciences, 217, 65-77.
 Ahuja, R.K., Ergun, O., Orlin, J.B. and Punnen, A.P. (2002) A Survey of Very Large Scale Neighborhood Search Techniques. Discrete Applied Mathematics, 123, 75-102. http://dx.doi.org/10.1016/j.ins.2012.06.032
 Reeves, C.R. (1995) A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research, 22, 5-13.
 Reeves, C.R. and Yamada, T. (1998) Genetic Algorithms, Path Relinking and the Flowshop Sequencing Problem. Evolutionary Computation Journal (MIT Press), 6, 230-234.
 Armentano, V.A. and Ronconi, D.P. (1999) Tabu Search for Total Tardiness Minimization in Flowshop Scheduling Problems. Computers & Operations Research, 26, 219-235.
 Ek?io?lu, B., Ek?io?lu, S.D. and Jain, P. (1998) A Tabu Search Algorithm for the Flowshop Scheduling Problem with Changing Neighborhoods. Computer & Industrial Engineering, 1-11.
 Rajendran, C. and Ziegler, H. (2004) Ant-Colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs. European Journal of Operational Research, 155, 426-438.
 Taillard, E. (1989) Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem.
 Lissaman, P.B.S. and Shollenberger, C.A. (1970) Formation Flight of Birds. Science, 168, 1003-1005.
 Burkard, R.E., ?ela, E., Karisch, S.E. and Rendl, F. (2010) QAPLIB Aquadratic Assignment Problem Library.