1. Bárány, I. and T. Fiala (1982). Többgépes Ütemezési Problémák Közel Optimális Megoldása.Szigma-Mat.-Közgadasági Folyóirat 15, 177–191.
2. Dell'Amico, M. and M. Trubian (1993). Applying Tabu Search to the Job-Shop Scheduling Problem.Annals of Operations Research 41, 231–252.
3. Dell'Amico, M., S. Martello and D. Vigo (1996). Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties.Meta-Heuristics: Theory and Applications (J.P. Kelly and I.H. Osman, eds.) Kluwer, Boston.
4. Anderson, E.J., C.A. Glass and C.N. Potts (1997). Machine Scheduling.Local Search in Combinatorial Optimization (E.H.L. Aarts and J.K. Lenstra, eds.) Wiley, Chichester.
5. Glover, F. (1989). Tabu Search, Part I.ORSA J. Comput. 1, 190–206.