Skip to main content
Springer Nature Link
Log in

Review of state of the art for metaheuristic techniques in Academic Scheduling Problems

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

The Academic Scheduling Problems have drawn great interest from many researchers of various fields, such as operational research and artificial intelligence. Despite the long history of literature, the problem still remains as an interesting research topic as new and emerging metaheuristic techniques continue to exhibit promising results. This paper surveys the properties of the Academic Scheduling Problems, such as the complexity of the problem and the constraints involved and addresses the various metaheuristic techniques and strategies used in solving them. The survey in this paper presents the aspects of solution quality in terms of computational speed, feasibility and optimality of a solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Alvarez-Valdes R, Crespo E, Tamarit JM (2001) Design and implementation of a course scheduling system using Tabu search. Eur J Oper Res 137(3):512–523

    Article  Google Scholar 

  • Asmuni H, Burke EK, Garibaldi JM, McCollum B (2005) Fuzzy multiple heuristic orderings for examination timetabling. Paper presented at the PATAT, LNCS

  • Aycan E, Ayav T (2009) Solving the course scheduling problem using simulate snnealing. Paper presented at the IEEE international advance computing conference (IACC)

  • Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York

    Google Scholar 

  • Bardadym VA (1996) Computer-aided school and university timetabling: the new wave. In: Practice and theory of automated timetabling. Lecture notes in Computer Science, vol 1153. pp 22–45

  • Beligiannis GN, Moschopoulos CN, Kaperonis GP, Likothanassis SD (2008) Applying evolutionary computation to the school timetabling problem: the Greek case. Comput Oper Res 35(4):1265–1280

    Article  MATH  Google Scholar 

  • Beligiannis GN, Moschopoulos CN, Likothanassis SD (2009) A genetic algorithm algorithm approach to school timetabling. J Oper Res Soc 60(1):23–42

    Article  MATH  Google Scholar 

  • Blum C, Dorigo M (2002) On a particularity in model-based search. In: Paper presented at the genetic and evolutionary computation conference

  • Blum C, Dorigo M (2004) Theoretical and practical aspects of ant colony optimization. Theor Comput Sci 344(2–3):243–278

    Google Scholar 

  • Brownlee J (2011) Clever algorithms: nature-inspired programming pecipes: Lulu Enterprises

  • Burke EK, Elliman DG, Weare RF (1994) A University timetabling system based on graph colouring and constraint manipulation. J Res Comput Educ 27(1):1–18

    Google Scholar 

  • Burke EK, Elliman DG, Weare RF (1995) A hybrid genetic algorithm for highly constrained timetabling problems. In: Proceedings of the 6th international conference on genetic algorithms, pp 605–610

  • Burke EK, Hart E, Kendall G, Newall J, Ross P, Schulenberg S (2003) Hyper-heuristics: an emerging direction in modern search technology handbook of metaheuristics. In: International series in operations research and management science, vol 57. Kluwer

  • Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Qu R (2010) Hyper-heuristics: a survey of the state of the art: School of Computer Science and Information Technology. University of Nottingham

  • Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176:177–192

    Article  MATH  MathSciNet  Google Scholar 

  • Casusmaecker PD, Demeester P, Berghe GV (2009) A decomposed metaheuristic approach for a real-world university timetabling problem. Eur J Oper Res 195:307–318

    Article  Google Scholar 

  • Chakhlevitch K, Cowling P (2008) Hyperheuristics: recent developments. In: Cotta C, Sevaux M, Sörensen K (eds) Adaptive and multilevel metaheuristics SE - 1, 136. Springer, Berlin, pp 3–29

    Chapter  Google Scholar 

  • Chaudhuri A, De K (2010) Fuzzy genetic heuristic for university course timetable problem. Int J Adv Soft Comput Appl 2(1):100–121

    Google Scholar 

  • Cordon O, Viana IFD, Herrera F (2002) Analysis of the best-worst ant system and its variants on the QAP. In: Paper presented at the third international workshop on ant algorithms

  • Cordon O, Viana IFD, Herrera F, Moreno L (2000) A new ACO model integrating evolutionary computation concepts: the best-worst ant system. In: Paper presented at the 2nd international workshop on ant algorithm. Universite Libre de Bruxelles, Belgium

  • Cupic M, Golub M, Jakobovic D (2009) Exam timetabling using genetic algorithm. In: Paper presented at the ITI 31st international conference on information technology interfaces, Croatia

  • Denzinger J, Fuchs M, Fuchs M (1996) High performance ATP systems by combining several AI methods. University of Fachbereich Informatik, Berlin

  • Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. Comput Intell Mag IEEE 1(4):28–39

    Google Scholar 

  • Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243–278

    Article  MATH  MathSciNet  Google Scholar 

  • Elmohamed MAS, Coddington P, Fox G (1998) A comparison of annealing techniques for academic course scheduling. Springer, Berlin

    Book  Google Scholar 

  • Ghaemi S, Vakili MT (2006) Using a genetic algorithm optimizer tool to solve university timetable scheduling problem. Faculty of Electrical and Computer Engineering, University of Tabriz, Iran

    Google Scholar 

  • Ghalia MB (2008) Particle swarm optimization with an improved exploration-exploitation balance. In: Paper presented at the 51st IEEE international midwest symposium on circuits and systems.

  • Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(533):533–549

    Article  MATH  MathSciNet  Google Scholar 

  • Glover F, McMillan C (1986) The general employee scheduling problem: an integration of MS and AI. Comput Oper Res 13(5):563–573

    Article  Google Scholar 

  • Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading

  • Gonzalez TF (2007) Handbook of approximation algorithms and metaheuristics. CRC Press INC

  • Guang-Feng D, Woo-Tsong L (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787–5793

    Article  Google Scholar 

  • Gupta P, Bansal M, Prakash H (2006) Implementation of timetable problem using genetic algorithm. Department of Computer Science Engineering, Indian Institute of Technology, Kanpur, Project Report

  • Haupt RL, Haupt SE (2004) Practical genetic algorithms. Wiley, Hoboken, New Jersey

    MATH  Google Scholar 

  • Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann Harbor

    MATH  Google Scholar 

  • Johnson DS, McGeoch LA (1997) The travelling salesman problem: a case study in local optimization. Wiley, New York

    Google Scholar 

  • Kanit R, Ozkan O, Gunduz M (2009) Effects of project size and resource constraints on project duration through priority rule-base heuristics. Artif Intell Rev 32(1–4):115–123

    Article  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Paper presented at the IEEE international conference on neural networks, pp 1942–1948

  • Kingston JH (2004) A tiling algorithm for High School timetabling. In: Paper presented at the fifth international conference on practice and theory of automated timetabling

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MATH  MathSciNet  Google Scholar 

  • Kordalewski D, Liu C, Salvesen K (2009) Solving an exam scheduling problem using a genetic algorithm. Department of Statistics, University of Toronto, Toronto, Canada

    Google Scholar 

  • Lewis R (2007) A survey of metaheuristic-based techniques for university timetabling problems. OR SpectR 30(1):167–190

    Article  Google Scholar 

  • Lewis R, Thompson J (2011) On the application of graph colouring techniques in round-robin sports scheduling. Comput Oper Res 38:190–204

    Article  MATH  MathSciNet  Google Scholar 

  • Lim HT, Razamin R (2010) Recent advancements of nurse scheduling models and a potential path. In: Paper presented at the IMT-GT conference on mathematics, statistics and its applications (ICMSA2010), Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia

  • Lutuksin T, Pongcharoen P (2010) Best-worst ant colony system parameter investigation by using experimental design and analysis for course timetabling problem. In: Paper presented at the second international conference on Computer and Network Technology

  • Mariott K, Stuckey PJ (1998) Programming with constraints: an introduction. MIT Press, Cambridge

    Google Scholar 

  • Md Sultan AB, Ramlan M (2008) Selecting quality initial random seed for metaheuristic approaches: a case of timetabling problem. Int J Comput Internet Manag 16(1):8

    Google Scholar 

  • Moreira JJ (2008) A system for automatic construction of exam timetable using genetic algorithms. Tékhne-Revista de Estudos Politéchnicos (9):319–336

  • Nuntasen N, Innet S (2007) A novel approach of genetic algorithm for solving university timetabling problems: a case study of thai universities. In: Paper presented at the international conference on Applied Computer Science

  • Omar M, Ainon RN, Zainuddin R (2003) Using a genetic algorithm optimizer tool to generate good quality timetables. In: Proceedings of the 10th IEEE international conference, electronics, circuits and systems, vol 3, pp 1300–1303

  • Papoutsis K, Valouxis C, Housos E (2003) A column generation approach for the timetabling problem of Greek high schools. J Oper Res Soc 54(3):230–238

    Article  MATH  Google Scholar 

  • Petrovic S, Patel V, Yang Y (2005) Examination timetabling with fuzzy constraints. In: Practice and theory of automated timetabling V. Lecture Notes in Computer Science, vol 3616

  • Pinedo ML (2012) Scheduling theory, algorithms and systems. Springer, Berlin

    MATH  Google Scholar 

  • Pongcharoen P, Promtet W, Yenradee P, Hicks C (2007) Stochastic optimisation timetabling tool for university course scheduling. Int J Prod Econ 112(2):903–918

    Article  Google Scholar 

  • Qarouni-Fard D, Najafi-Ardabli A, Moeinzadeh M-H, (2007) Finding Feasible Timetables with Particle Swarm Optimization. In: Proceedings of the 4th international conference on innovations in information technology, pp 387–391

  • Qu R, Burke EK, Mccollum B, Merlot LT, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J Sched 12(1):55–89

    Article  MATH  MathSciNet  Google Scholar 

  • Sabri MFM, Husin MH, Chai SK (2010) Development of a timetabling software using soft-computing techniques with a case study. IEEE 5:394–397

    Google Scholar 

  • Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371

    Article  Google Scholar 

  • Shu-Chuan C, Yi-Tin C (2006) Timetable scheduling using particle swarm optimization. In: Paper presented at the first international conference on innovative computing, information and control

  • Singh E, Joshi VD, Gupta N (2008) Optimizing highly constrained examination timetable problems. J Appl Math Stat Inf 4(2):193–197

    Google Scholar 

  • Sivanandam SM, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin

    MATH  Google Scholar 

  • Suyanto S (2010) An informed genetic algorithm for university course and student timetabling problems. In: Proceedings of the 10th international conference on artifical intelligence and soft computing: Part II, Berlin, Heidelberg, pp 229–236

  • Tahar M (2010) Universal tool for university course schedule using genetic algorithm. (IJCNS). Int J Comput Netw Secur 2(6):1–6

    Google Scholar 

  • Tassopoulos IX, Beligiannis GN (2012) Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst Appl 39:6029–6040

    Article  Google Scholar 

  • Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999) Evolution of constraint satisfaction strategies in examination timetabling. In: Paper presented at the genetic and evolutionary computation conference (GECCO-99)

  • Turabieh H, Abdullah S (2011) An integrated hybrid approach to the examination timetabling problem. Int J Manag Sci 39:598–607

    Google Scholar 

  • Valouxis C, Housos E (2003) Constraint programming approach for school timetabling. Comput Oper Res 30(10):1555–1572

    Article  MATH  Google Scholar 

  • Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353

    Article  MATH  MathSciNet  Google Scholar 

  • Zhang D, Liu Y, M’Hallah R (2010) A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur J Oper Res 203(3):550–558

    Article  MATH  Google Scholar 

  • Zhipeng L, Jin-Kao H (2010) Adaptive Tabu search for course imetabling. Eur J Oper Res 200:235–244

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia (UTM), 81310, Johor Bahru, Johor, Malaysia

    Chong Keat Teoh, Antoni Wibowo & Mohd Salihin Ngadiman

Authors
  1. Chong Keat Teoh
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Antoni Wibowo
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Mohd Salihin Ngadiman
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Chong Keat Teoh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Teoh, C.K., Wibowo, A. & Ngadiman, M.S. Review of state of the art for metaheuristic techniques in Academic Scheduling Problems. Artif Intell Rev 44, 1–21 (2015). https://doi.org/10.1007/s10462-013-9399-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-013-9399-6

Keywords