Reactive Tabu Search in a Team-Learning Problem

References

• Baker K., Magazine M., Polak G. Optimal block design models for cohorts timetabling. Oper. Res. Lett. (2002) 30:1–8Crossref, Google Scholar
• Baker K., Magazine M., Polak G., Shen Y., Duenyas I., Zhang R. Cohort timetabling. Proc. MSOM Conf. (2000) Ann Arbor, MI(University of Michigan, Ann Arbor) Google Scholar
• Bardadym V., Carter M., Ross P. Computer aided school and university timetabling: The new wave. Practice and Theory of Automated Timetabling (1996) 1153(Springer, Berlin/Heidelberg) 22–45Springer Lecture Notes in Computer Science SeriesCrossref, Google Scholar
• Battiti R., Tecchiolli G. The reactive tabu search. ORSA J. Comput. (1994) 6:126–140Link, Google Scholar
• Burke E., Petrovic S. Recent research directions in automated timetabling. Eur. J. Oper. Res. (2002) 140:266–280Crossref, Google Scholar
• Burke E., Kingston J., de Werra D., Gross J., Yellen J. Application to timetabling. Handbook of Graph Theory (2004) (Chapman & Hall/CRC Press, Boca Raton, FL) 445–474Google Scholar
• Burke E., Jackson K., Kingston J., Weare R. Automated timetabling: The state of the art. Comput. J. (1997) 40:565–571Crossref, Google Scholar
• Carter M. A survey of practical applications of examination timetabling algorithms. Oper. Res. (1986) 34:193–202Link, Google Scholar
• Carter M., Laporte G., Burke E., Ross P. Recent developments in practical exam timetabling. Practice and Theory of Automated Timetabling (1996) 1153(Springer, Berlin/Heidelberg) 3–21Springer Lecture Notes in Computer Science SeriesCrossref, Google Scholar
• Carter M., Laporte G., Burke E., Carter M. Recent developments in practical course timetabling. Practice and Theory of Automated Timetabling (1998) 1408(Springer, Berlin/Heidelberg) 3–19Springer Lecture Notes in Computer Science SeriesCrossref, Google Scholar
• Cela E.The Quadratic Assignment Problem (1998) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Chaovalitwongse W., Pardalos P., Iasemidis L., Shiau D., Sackellares J. Dynamic approaches and multi-quadratic integer programming for seizure prediction. Optim. Methods Software (2005) 20:383–394Crossref, Google Scholar
• Chiang W., Russell R. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. (1997) 9:417–430Link, Google Scholar
• Chiang W., Kouvelis P., Urban T. Improving workflow interference in facility design: The quartic assignment problem. Management Sci. (2002) 48:584–590Link, Google Scholar
• Darby-Dowman K., Little J. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J. Comput. (1998) 10:276–286Link, Google Scholar
• de Werra D. An introduction to timetabling. Eur. J. Oper. Res. (1985) 19:151–162Crossref, Google Scholar
• Dey A.Theory of Block Designs (1986) (John Wiley & Sons, New York) Google Scholar
• Dongarra J. Performance of various computers using standard linear equations software. (2006) . Technical Report CS-89-85. University of Tennessee, KnoxvilleGoogle Scholar
• Fourer R. “Balanced” assignment. (1997) . Reprinted from Compass News, Fall 1997, no. 5. http://www.ampl.com/CASES/balassign.htmlGoogle Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 5:533–549Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Glover F., Kochenberger G., Alidaee B. Adaptive memory tabu search for binary quadratic programs. Management Sci. (1998) 44:337–345Link, Google Scholar
• John J.Cyclic Designs (1987) (Chapman and Hall, New York) Crossref, Google Scholar
• Johnson K., Johnson J.School Timetabling (1989) (Hutchinson Ltd., London) Google Scholar
• Kirkwood C. Selecting student project teams when it really matters: An optimization-based approach using Internet resources. INFORMS Trans. Ed. (2004) 4:9–27Link, Google Scholar
• Landa Silva J., Burke E., Petrovic S., Gandibleux X., Sevaux M., Sorensen K., T'kindt V. An introduction to multiobjective metaheuristics for scheduling and timetabling. Metaheuristic for Multiobjective Optimization. Lecture Notes in Economics and Mathematical Systems (2004) 535(Springer, Berlin) 91–129Google Scholar
• Lawler E. The quadratic assignment problem. Management Sci. (1963) 9:586–599Link, Google Scholar
• Marriott K., Stuckey P.Programming with Constraints (1998) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Petrovic S., Burke E., Leung J. University timetabling. Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004) (Chapman & Hall/CRC Press, Boca Raton, FL) 45-1–45-23Chapter 45Google Scholar
• Schaerf A. A survey of automated timetabling. Artificial Intelligence Rev. (1999) 13:87–127Crossref, Google Scholar
• Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J. Comput. (1990) 2:33–45Link, Google Scholar
• Timmers K. Learning together better: The structured design of learning teams. (2004) . Master's thesis, Operations Research Center, Massachusetts Institute of Technology, CambridgeGoogle Scholar
• Van Hentenryck P.The Optimization Programming Language (1999) (MIT Press, Cambridge, MA) Google Scholar
• Wren A., Burke E., Ross P. Scheduling, timetabling and rostering—A special relationship? Practice and Theory of Automated Timetabling. Springer Lecture Notes in Computer Science Series (1996) 1153(Springer, Berlin/Heidelberg) 46–75Crossref, Google Scholar