5GAREY M R, JOHNSON D S, Computers and Intractability-A guide to the Theory of NP-Completeness [ M ]. San Francisco: W. H. Freeman and Company, 1979:30 - 35. 被引量：1
6SANTOS H G, OCHI H S, SOUZA M J F. An Efficient Tabu Search Heuristic for the School Timetabling Problem[ C ]//Experi- mental and Efficient Algorithms. Berlin: Springer, 2004:468 -481. 被引量：1
