Skip to main content
Erschienen in: Artificial Intelligence Review 1/2015

01.06.2015

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

verfasst von: Chong Keat Teoh, Antoni Wibowo, Mohd Salihin Ngadiman

Erschienen in: Artificial Intelligence Review | Ausgabe 1/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat 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–523CrossRef 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–523CrossRef
Zurück zum Zitat Asmuni H, Burke EK, Garibaldi JM, McCollum B (2005) Fuzzy multiple heuristic orderings for examination timetabling. Paper presented at the PATAT, LNCS Asmuni H, Burke EK, Garibaldi JM, McCollum B (2005) Fuzzy multiple heuristic orderings for examination timetabling. Paper presented at the PATAT, LNCS
Zurück zum Zitat Aycan E, Ayav T (2009) Solving the course scheduling problem using simulate snnealing. Paper presented at the IEEE international advance computing conference (IACC) Aycan E, Ayav T (2009) Solving the course scheduling problem using simulate snnealing. Paper presented at the IEEE international advance computing conference (IACC)
Zurück zum Zitat Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
Zurück zum Zitat 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 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
Zurück zum Zitat 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–1280CrossRefMATH 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–1280CrossRefMATH
Zurück zum Zitat Beligiannis GN, Moschopoulos CN, Likothanassis SD (2009) A genetic algorithm algorithm approach to school timetabling. J Oper Res Soc 60(1):23–42CrossRefMATH Beligiannis GN, Moschopoulos CN, Likothanassis SD (2009) A genetic algorithm algorithm approach to school timetabling. J Oper Res Soc 60(1):23–42CrossRefMATH
Zurück zum Zitat 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 (2002) On a particularity in model-based search. In: Paper presented at the genetic and evolutionary computation conference
Zurück zum Zitat Blum C, Dorigo M (2004) Theoretical and practical aspects of ant colony optimization. Theor Comput Sci 344(2–3):243–278 Blum C, Dorigo M (2004) Theoretical and practical aspects of ant colony optimization. Theor Comput Sci 344(2–3):243–278
Zurück zum Zitat Brownlee J (2011) Clever algorithms: nature-inspired programming pecipes: Lulu Enterprises Brownlee J (2011) Clever algorithms: nature-inspired programming pecipes: Lulu Enterprises
Zurück zum Zitat 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 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
Zurück zum Zitat 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, 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
Zurück zum Zitat 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, 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
Zurück zum Zitat 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, 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
Zurück zum Zitat 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–192CrossRefMATHMathSciNet 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–192CrossRefMATHMathSciNet
Zurück zum Zitat Casusmaecker PD, Demeester P, Berghe GV (2009) A decomposed metaheuristic approach for a real-world university timetabling problem. Eur J Oper Res 195:307–318CrossRef Casusmaecker PD, Demeester P, Berghe GV (2009) A decomposed metaheuristic approach for a real-world university timetabling problem. Eur J Oper Res 195:307–318CrossRef
Zurück zum Zitat 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–29CrossRef 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–29CrossRef
Zurück zum Zitat Chaudhuri A, De K (2010) Fuzzy genetic heuristic for university course timetable problem. Int J Adv Soft Comput Appl 2(1):100–121 Chaudhuri A, De K (2010) Fuzzy genetic heuristic for university course timetable problem. Int J Adv Soft Comput Appl 2(1):100–121
Zurück zum Zitat 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 (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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Denzinger J, Fuchs M, Fuchs M (1996) High performance ATP systems by combining several AI methods. University of Fachbereich Informatik, Berlin Denzinger J, Fuchs M, Fuchs M (1996) High performance ATP systems by combining several AI methods. University of Fachbereich Informatik, Berlin
Zurück zum Zitat Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. Comput Intell Mag IEEE 1(4):28–39 Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. Comput Intell Mag IEEE 1(4):28–39
Zurück zum Zitat Elmohamed MAS, Coddington P, Fox G (1998) A comparison of annealing techniques for academic course scheduling. Springer, BerlinCrossRef Elmohamed MAS, Coddington P, Fox G (1998) A comparison of annealing techniques for academic course scheduling. Springer, BerlinCrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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. 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.
Zurück zum Zitat Glover F, McMillan C (1986) The general employee scheduling problem: an integration of MS and AI. Comput Oper Res 13(5):563–573CrossRef Glover F, McMillan C (1986) The general employee scheduling problem: an integration of MS and AI. Comput Oper Res 13(5):563–573CrossRef
Zurück zum Zitat Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading
Zurück zum Zitat Gonzalez TF (2007) Handbook of approximation algorithms and metaheuristics. CRC Press INC Gonzalez TF (2007) Handbook of approximation algorithms and metaheuristics. CRC Press INC
Zurück zum Zitat Guang-Feng D, Woo-Tsong L (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787–5793CrossRef Guang-Feng D, Woo-Tsong L (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787–5793CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Haupt RL, Haupt SE (2004) Practical genetic algorithms. Wiley, Hoboken, New JerseyMATH Haupt RL, Haupt SE (2004) Practical genetic algorithms. Wiley, Hoboken, New JerseyMATH
Zurück zum Zitat Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann HarborMATH Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann HarborMATH
Zurück zum Zitat Johnson DS, McGeoch LA (1997) The travelling salesman problem: a case study in local optimization. Wiley, New York Johnson DS, McGeoch LA (1997) The travelling salesman problem: a case study in local optimization. Wiley, New York
Zurück zum Zitat 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–123CrossRef 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–123CrossRef
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Paper presented at the IEEE international conference on neural networks, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Paper presented at the IEEE international conference on neural networks, pp 1942–1948
Zurück zum Zitat 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 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
Zurück zum Zitat Kordalewski D, Liu C, Salvesen K (2009) Solving an exam scheduling problem using a genetic algorithm. Department of Statistics, University of Toronto, Toronto, Canada Kordalewski D, Liu C, Salvesen K (2009) Solving an exam scheduling problem using a genetic algorithm. Department of Statistics, University of Toronto, Toronto, Canada
Zurück zum Zitat Lewis R (2007) A survey of metaheuristic-based techniques for university timetabling problems. OR SpectR 30(1):167–190CrossRef Lewis R (2007) A survey of metaheuristic-based techniques for university timetabling problems. OR SpectR 30(1):167–190CrossRef
Zurück zum Zitat Lewis R, Thompson J (2011) On the application of graph colouring techniques in round-robin sports scheduling. Comput Oper Res 38:190–204CrossRefMATHMathSciNet Lewis R, Thompson J (2011) On the application of graph colouring techniques in round-robin sports scheduling. Comput Oper Res 38:190–204CrossRefMATHMathSciNet
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Mariott K, Stuckey PJ (1998) Programming with constraints: an introduction. MIT Press, Cambridge Mariott K, Stuckey PJ (1998) Programming with constraints: an introduction. MIT Press, Cambridge
Zurück zum Zitat 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 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
Zurück zum Zitat Moreira JJ (2008) A system for automatic construction of exam timetable using genetic algorithms. Tékhne-Revista de Estudos Politéchnicos (9):319–336 Moreira JJ (2008) A system for automatic construction of exam timetable using genetic algorithms. Tékhne-Revista de Estudos Politéchnicos (9):319–336
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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–238CrossRefMATH 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–238CrossRefMATH
Zurück zum Zitat 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 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
Zurück zum Zitat Pinedo ML (2012) Scheduling theory, algorithms and systems. Springer, BerlinMATH Pinedo ML (2012) Scheduling theory, algorithms and systems. Springer, BerlinMATH
Zurück zum Zitat Pongcharoen P, Promtet W, Yenradee P, Hicks C (2007) Stochastic optimisation timetabling tool for university course scheduling. Int J Prod Econ 112(2):903–918CrossRef Pongcharoen P, Promtet W, Yenradee P, Hicks C (2007) Stochastic optimisation timetabling tool for university course scheduling. Int J Prod Econ 112(2):903–918CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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–89CrossRefMATHMathSciNet 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–89CrossRefMATHMathSciNet
Zurück zum Zitat Sabri MFM, Husin MH, Chai SK (2010) Development of a timetabling software using soft-computing techniques with a case study. IEEE 5:394–397 Sabri MFM, Husin MH, Chai SK (2010) Development of a timetabling software using soft-computing techniques with a case study. IEEE 5:394–397
Zurück zum Zitat Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371CrossRef Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Singh E, Joshi VD, Gupta N (2008) Optimizing highly constrained examination timetable problems. J Appl Math Stat Inf 4(2):193–197 Singh E, Joshi VD, Gupta N (2008) Optimizing highly constrained examination timetable problems. J Appl Math Stat Inf 4(2):193–197
Zurück zum Zitat Sivanandam SM, Deepa SN (2008) Introduction to genetic algorithms. Springer, BerlinMATH Sivanandam SM, Deepa SN (2008) Introduction to genetic algorithms. Springer, BerlinMATH
Zurück zum Zitat 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 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
Zurück zum Zitat Tahar M (2010) Universal tool for university course schedule using genetic algorithm. (IJCNS). Int J Comput Netw Secur 2(6):1–6 Tahar M (2010) Universal tool for university course schedule using genetic algorithm. (IJCNS). Int J Comput Netw Secur 2(6):1–6
Zurück zum Zitat Tassopoulos IX, Beligiannis GN (2012) Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst Appl 39:6029–6040CrossRef Tassopoulos IX, Beligiannis GN (2012) Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst Appl 39:6029–6040CrossRef
Zurück zum Zitat 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) 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)
Zurück zum Zitat Turabieh H, Abdullah S (2011) An integrated hybrid approach to the examination timetabling problem. Int J Manag Sci 39:598–607 Turabieh H, Abdullah S (2011) An integrated hybrid approach to the examination timetabling problem. Int J Manag Sci 39:598–607
Zurück zum Zitat Valouxis C, Housos E (2003) Constraint programming approach for school timetabling. Comput Oper Res 30(10):1555–1572CrossRefMATH Valouxis C, Housos E (2003) Constraint programming approach for school timetabling. Comput Oper Res 30(10):1555–1572CrossRefMATH
Zurück zum Zitat 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–558CrossRefMATH 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–558CrossRefMATH
Zurück zum Zitat Zhipeng L, Jin-Kao H (2010) Adaptive Tabu search for course imetabling. Eur J Oper Res 200:235–244CrossRefMATH Zhipeng L, Jin-Kao H (2010) Adaptive Tabu search for course imetabling. Eur J Oper Res 200:235–244CrossRefMATH
Metadaten
Titel
Review of state of the art for metaheuristic techniques in Academic Scheduling Problems
verfasst von
Chong Keat Teoh
Antoni Wibowo
Mohd Salihin Ngadiman
Publikationsdatum
01.06.2015
Verlag
Springer Netherlands
Erschienen in
Artificial Intelligence Review / Ausgabe 1/2015
Print ISSN: 0269-2821
Elektronische ISSN: 1573-7462
DOI
https://doi.org/10.1007/s10462-013-9399-6

Weitere Artikel der Ausgabe 1/2015

Artificial Intelligence Review 1/2015 Zur Ausgabe