{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:35:44Z","timestamp":1781109344302,"version":"3.54.1"},"reference-count":77,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,1,1]]},"abstract":"<p>Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selection and move acceptance) until a set of termination criteria is satisfied. A motivating goal of hyper-heuristic research is to create automated techniques that are applicable to a wide range of problems with different characteristics. Some previous studies show that different combinations of heuristic selection and move acceptance as hyper-heuristic components might yield different performances. This study investigates whether learning heuristic selection can improve the performance of a great deluge based hyper-heuristic using an examination timetabling problem as a case study.<\/p>","DOI":"10.4018\/jamc.2010102603","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T14:31:21Z","timestamp":1297780281000},"page":"39-59","source":"Crossref","is-referenced-by-count":85,"title":["A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling"],"prefix":"10.4018","volume":"1","author":[{"given":"Ender","family":"\u00d6zcan","sequence":"first","affiliation":[{"name":"University of Nottingham, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mustafa","family":"Misir","sequence":"additional","affiliation":[{"name":"Yeditepe University, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[{"name":"University of Nottingham, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[{"name":"University of Nottingham, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2010102603-0","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-006-0034-7"},{"key":"jamc.2010102603-1","doi-asserted-by":"crossref","unstructured":"Alkan, A., & \u00d6zcan, E. (2003). Memetic algorithms for timetabling. In Proceedings of 2003 IEEE Congress on Evolutionary Computation (pp. 1796-1802).","DOI":"10.1109\/CEC.2003.1299890"},{"key":"jamc.2010102603-2","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-7187-8"},{"key":"jamc.2010102603-3","unstructured":"Ayob, M., & Kendall, G. (2003). A monte carlo hyper-Heuristic to optimise component placement sequencing for multi head placement machine. In Proceedings of the International Conference on Intelligent Technologies (InTech\u201903) (pp. 132-141)."},{"key":"jamc.2010102603-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2003.10.061"},{"key":"jamc.2010102603-5","unstructured":"Bai, R., Blazewicz, J., Burke, E., Kendall, G., & McCollum, B. (2007a). A simulated annealing hyper-heuristic methodology for flexible decision support (Computer Science Tech. Rep. No. NOTTCS-TR-2007-8). Nottingham, UK: University of Nottingham."},{"key":"jamc.2010102603-6","doi-asserted-by":"crossref","unstructured":"Bai, R., Burke, E. K., Kendall, G., & McCollum, B. (2007b). Memory length in hyper-heuristics: an empirical study. In Proceedings of 2007 IEEE Symposium on Computational Intelligence in Scheduling (CISched2007) (pp. 173-178).","DOI":"10.1109\/SCIS.2007.367686"},{"key":"jamc.2010102603-7","doi-asserted-by":"crossref","unstructured":"Bai, R., & Kendall, G. (2003). An investigation of automated planograms using a simulated annealing based hyper-heuristics. In T. Ibaraki, K. Nonobe, & M. Yagiura (Ed.), Meta-heuristics: Progress as Real Problem Solvers, selected papers from the 5th Metaheuristics International Conference (MIC\u201903) (pp. 87-108). New York: Springer.","DOI":"10.1007\/0-387-25383-1_4"},{"key":"jamc.2010102603-8","doi-asserted-by":"crossref","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2007). An experimental study on hyper-heuristics and exam scheduling. In Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201906) (LNCS 3867, pp. 394-412).","DOI":"10.1007\/978-3-540-77345-0_25"},{"key":"jamc.2010102603-9","doi-asserted-by":"publisher","DOI":"10.1145\/355586.364824"},{"key":"jamc.2010102603-10","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR0302139B"},{"key":"jamc.2010102603-11","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Rong, Q. (2009b). A survey of hyper-heuristics (Computer Science Tech. Rep. No. NOTTCS-TR-SUB-0906241418-2747). Nottingham, UK: University of Nottingham."},{"key":"jamc.2010102603-12","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Woodward, J. R. (2009a). Exploring hyper-heuristic methodologies with genetic programming. In C. L. Mumford & L. C. Jain (Eds.), Computational intelligence: Collaboration, fusion and emergence (pp. 177-201). New York: Springer.","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"jamc.2010102603-13","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Woodward, J. R. (2009c). A classification of hyper-heuristic appraoches (Computer Science Tech. Rep. No. NOTTCS-TR-SUB-0907061259-5808). Nottingham, UK: University of Nottingham."},{"key":"jamc.2010102603-14","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2003a). Hyper-heuristics: An emerging direction in modern search technology. In F. W. Glover & G. A. Kochenberger (Ed.), Handbook of Metaheuristics (Vol. 57, pp. 457-474). Dordrecht, The Netherlands: Kluwer International Publishing.","DOI":"10.1007\/0-306-48056-5_16"},{"key":"jamc.2010102603-15","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"jamc.2010102603-16","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Dror, M., Petrovic, S., & Qu, R. (2005). Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems. In B. L. Golden, S. Raghavan, & E. A. Wasil (Ed.), The next wave in computing, optimization, and decision technologies: Proceedings of the 9th Informs Computing Society Conference (pp. 79-91). Springer.","DOI":"10.1007\/0-387-23529-9_6"},{"key":"jamc.2010102603-17","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Elliman, D. G., Ford, P. H., & Weare, R. F. (1996a). Examination timetabling in British universities - a survey. In E. K. Burke & P. Ross (Eds.), Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh (LNCS 1153, pp.76-92).","DOI":"10.1007\/3-540-61794-9_52"},{"key":"jamc.2010102603-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"jamc.2010102603-19","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000030684.30824.08"},{"key":"jamc.2010102603-20","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1996b). A memetic algorithm for university exam timetabling. In E. K. Burke & P. Ross (Eds.), Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh (LNCS 1153, pp. 241-250).","DOI":"10.1007\/3-540-61794-9_63"},{"key":"jamc.2010102603-21","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-6775-y"},{"key":"jamc.2010102603-22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0354"},{"key":"jamc.2010102603-23","doi-asserted-by":"crossref","unstructured":"Caramia, M., DellOlmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In S. Naher & D. Wagner (Eds.), Algorithm Engineering 4th International Workshop (WAE\u201900) (LNCS 1982, pp. 230-241).","DOI":"10.1007\/3-540-44691-5_20"},{"key":"jamc.2010102603-24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.193"},{"key":"jamc.2010102603-25","doi-asserted-by":"crossref","unstructured":"Carter, M. W., & Laporte, G. (1996a). Recent developments in practical examination timetabling. In E. K. Burke & P. Ross (Eds.), Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh (LNCS 1153, pp. 3-21).","DOI":"10.1007\/3-540-61794-9_49"},{"issue":"3","key":"jamc.2010102603-26","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","article-title":"Examination timetabling: Algorithmic strategies and applications.","volume":"47","author":"M. W.Carter","year":"1996","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2010102603-27","doi-asserted-by":"crossref","unstructured":"Casey, S., & Thompson, J. (2003). GRASPing the examination scheduling problem. In E. K. Burke & P. De Causmaecker (Eds.), Practice and theory of automated timetabling: Selected Papers from the 4th International Conference (LNCS 2740, pp. 232-244).","DOI":"10.1007\/978-3-540-45157-0_15"},{"key":"jamc.2010102603-28","doi-asserted-by":"crossref","unstructured":"Chakhlevitch, K., & Cowling, P. I. (2008). Hyperheuristics: Recent developments. In Adaptive and Multilevel Metaheuristics (pp. 3-29).","DOI":"10.1007\/978-3-540-79438-7_1"},{"key":"jamc.2010102603-29","doi-asserted-by":"crossref","unstructured":"Chen, P.-C., Kendall, G., & Berghe, G. V. (2007). An ant based hyper-heuristic for the travelling tournament problem. In Proceedings of IEEE Symposium of Computational Intelligence in Scheduling (CISched\u201907) (pp. 19-26).","DOI":"10.1109\/SCIS.2007.367665"},{"key":"jamc.2010102603-30","doi-asserted-by":"crossref","unstructured":"Cheong, C. Y., Tan, K. C., & Veeravalli, B. (2007). Solving the exam timetabling problem via a multi-objective evolutionary algorithm \u2013 a more general approach. In Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched\u201907) (pp. 165-172).","DOI":"10.1109\/SCIS.2007.367685"},{"key":"jamc.2010102603-31","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.117"},{"key":"jamc.2010102603-32","doi-asserted-by":"crossref","unstructured":"Corr, P. H., McCollum, B., McGreevy, M. A. J., & McMullan, P. (2006). A new neural network based construction heuristic for the examination timetabling problem. In T. P. Runarsson et al. (Eds.), PPSN IX (LNCS 4193, pp. 392-401).","DOI":"10.1007\/11844297_40"},{"key":"jamc.2010102603-33","doi-asserted-by":"crossref","unstructured":"Cowling, P., & Chakhlevitch, K. (2003). Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201903) (pp. 1214-1221).","DOI":"10.1109\/CEC.2003.1299807"},{"key":"jamc.2010102603-34","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., & Han, L. (2002). An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201902) (pp. 1185-1190).","DOI":"10.1109\/CEC.2002.1004411"},{"key":"jamc.2010102603-35","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001a). A hyperheuristic approach to scheduling a sales summit. In Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT\u201900) (pp. 176-190). Springer-Verlag.","DOI":"10.1007\/3-540-44629-X_11"},{"key":"jamc.2010102603-36","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001b). A parameter-free hyperheuristic for scheduling a sales summit. In Proceedings of 4th Metaheuristics International Conference (MIC\u201901) (pp. 127-131)."},{"key":"jamc.2010102603-37","doi-asserted-by":"crossref","unstructured":"Cuesta-Canada, A., Garrido, L., & Terashima-Marin, H. (2005). Building hyper-heuristics through ant colony optimization for the 2d bin packing problem. In Proceedings of the 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES\u201905) (LNCS 3684, pp. 654-660).","DOI":"10.1007\/11554028_91"},{"key":"jamc.2010102603-38","unstructured":"Denzinger, J., Fuchs, M., & Fuchs, M. (1997). High performance ATP systems by combining several ai methods. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 97) (pp. 102-107)."},{"key":"jamc.2010102603-39","doi-asserted-by":"crossref","unstructured":"Di Gaspero, L., & Schaerf, A. (2001). Tabu search techniques for examination timetabling. In E. K. Burke & W. Erben (Eds.), Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201900) (LNCS 2079, pp. 104-117).","DOI":"10.1007\/3-540-44629-X_7"},{"key":"jamc.2010102603-40","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601830"},{"key":"jamc.2010102603-41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.058"},{"key":"jamc.2010102603-42","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1993.1010"},{"key":"jamc.2010102603-43","doi-asserted-by":"crossref","unstructured":"Erben, W. (2001). A grouping genetic algorithm for graph colouring and exam timetabling. In K. Burke & W. Erben (Eds.), Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201900) (LNCS 2079, pp. 132-156).","DOI":"10.1007\/3-540-44629-X_9"},{"key":"jamc.2010102603-44","doi-asserted-by":"crossref","unstructured":"Ergul, A. (1996). GA-based examination scheduling experience at Middle East Technical University. In E. K. Burke & P. Ross (Eds.), Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh (LNCS 1153, pp. 212-226).","DOI":"10.1007\/3-540-61794-9_61"},{"key":"jamc.2010102603-45","unstructured":"Ersoy, E., \u00d6zcan, E., & Uyar, S. (2007). Memetic algorithms and hyperhill-climbers. In Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA\u201907) (pp. 156-166)."},{"key":"jamc.2010102603-46","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"jamc.2010102603-47","unstructured":"Fisher, H., & Thompson, G. L. (1961). Probabilistic learning combinations of local job-shop scheduling rules. Paper presented at the Factory Scheduling Conference, Carnegie Institue of Technology."},{"key":"jamc.2010102603-48","unstructured":"Han, L., & Kendall, G. (2003). An investigation of a tabu assisted hyper-heuristic genetic algorithm. Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201903), 3, (pp. 2230-2237)."},{"key":"jamc.2010102603-49","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","article-title":"Reinforcement learning: A survey.","volume":"4","author":"L. P.Kaelbling","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"key":"jamc.2010102603-50","doi-asserted-by":"crossref","unstructured":"Keller, R. E., & Poli, R. (2007). Cost-benefit investigation of a genetic-programming hyper-heuristic. In Proceedings of the 8th International Conference on Artificial Evolution (EA\u201907), Tours, France (pp. 13-24).","DOI":"10.1007\/978-3-540-79305-2_2"},{"key":"jamc.2010102603-51","doi-asserted-by":"crossref","unstructured":"Kendall, G., & Hussin, N. M. (2005). Tabu search hyper-heuristic approach to the examination timetabling problem at university of technology MARA. In E. K. Burke and M. Trick (Eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201904) (LNCS 3616, pp. 270-293).","DOI":"10.1007\/11593577_16"},{"key":"jamc.2010102603-52","doi-asserted-by":"crossref","unstructured":"Kendall, G., & Mohamad, M. (2004). Channel assignment in cellular communication using a great deluge hyper-heuristic. In Proceedings of the 12th IEEE International Conference on Network (ICON\u201904) (pp. 769-773).","DOI":"10.1109\/ICON.2004.1409283"},{"key":"jamc.2010102603-53","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"jamc.2010102603-54","unstructured":"Marin, H. T. (1998). Combinations of GAs and CSP strategies for solving examination timetabling problems. Unpublished PhD thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey."},{"key":"jamc.2010102603-55","doi-asserted-by":"crossref","unstructured":"Mar\u00edn-Bl\u00e1zquez, J., & Schulenburg, S. (2005). A hyper-heuristic framework with XCS: Learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In T. Kovacs, X. Llor\u00e0, K. Takadama, P. Lanzi, W. Stolzmann, & S. Wilson (Eds.), Proceedings of the 8th International Workshop on Learning Classifier Systems (IWLCS\u201905) (LNCS 4399, pp. 193-218).","DOI":"10.1007\/978-3-540-71231-2_14"},{"key":"jamc.2010102603-56","doi-asserted-by":"crossref","unstructured":"Merlot, L. T. G., Boland, N., Hughes, B. D., & Stuckey, P. J. (2002). A hybrid algorithm for the examination timetabling problem. In E. K. Burke & P. De Causmaecker (Eds.), Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201902) (LNCS 1153, pp. 207-231).","DOI":"10.1007\/978-3-540-45157-0_14"},{"key":"jamc.2010102603-57","doi-asserted-by":"crossref","unstructured":"Nareyek, A. (2003). Choosing search heuristics by non-stationary reinforcement learning. In Metaheuristics: Computer decision-making (pp. 523-544). Dordrecht, The Netherlands: Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-4137-7_25"},{"key":"jamc.2010102603-58","doi-asserted-by":"crossref","unstructured":"Ouelhadj, D., & Petrovic, S. (2008). A cooperative distributed hyper-heuristic framework for scheduling. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC\u201908) (pp. 2560-2565).","DOI":"10.1109\/ICSMC.2008.4811681"},{"key":"jamc.2010102603-59","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","article-title":"A comprehensive analysis of hyper-heuristics.","volume":"12","author":"E.\u00d6zcan","year":"2008","journal-title":"Intelligent Data Analysis"},{"key":"jamc.2010102603-60","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., & Burke, K. E. (2009). Examination timetabling using late acceptance hyper-heuristics. In Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC\u201909) (pp. 997-1004).","DOI":"10.1109\/CEC.2009.4983054"},{"key":"jamc.2010102603-61","unstructured":"\u00d6zcan, E., & Ersoy, E. (2005). Final exam scheduler \u2013 FES. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201905) (Vol. 2, pp. 1356-1363)."},{"key":"jamc.2010102603-62","unstructured":"Paquete, L. F., & Fonseca, C. M. (2001). A study of examination timetabling with multiobjective evolutionary algorithms. In Proceedings of the 4th Metaheuristics International Conference (MIC\u201901) (pp. 149-154)."},{"key":"jamc.2010102603-63","doi-asserted-by":"crossref","unstructured":"Petrovic, S., Patel, V., & Yang, Y. (2005). Examination timetabling with fuzzy constraints. In E. K. Burke & M. Trick (Eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201905) (LNCS 3616, pp. 313-333), Springer.","DOI":"10.1007\/11593577_18"},{"key":"jamc.2010102603-64","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.06.017"},{"key":"jamc.2010102603-65","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.023"},{"key":"jamc.2010102603-66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.10.001"},{"key":"jamc.2010102603-67","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0077-5"},{"key":"jamc.2010102603-68","doi-asserted-by":"crossref","unstructured":"Rattadilok, P., Gaw, A., & Kwan, R. (2005). Distributed choice function hyper-heuristics for timetabling and scheduling. In Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u20192004) (pp. 51-67).","DOI":"10.1007\/11593577_4"},{"key":"jamc.2010102603-69","doi-asserted-by":"crossref","unstructured":"Ross, P. (2005). Hyper-heuristics. In: E. K. Burke & G. Kendall (Eds.), Search methodologies: Introductory tutorials in optimization and decision support techniques (Ch. 17, pp. 529-556). New York: Springer.","DOI":"10.1007\/0-387-28356-0_17"},{"key":"jamc.2010102603-70","doi-asserted-by":"crossref","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge, MA: MIT Press.","DOI":"10.1109\/TNN.1998.712192"},{"key":"jamc.2010102603-71","doi-asserted-by":"crossref","unstructured":"Terashima-Marin, H. T., Moran-Saavedra, A., & Ross, P. (2005). Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation (Vol. 2, pp. 1104-1110).","DOI":"10.1145\/1068009.1068115"},{"key":"jamc.2010102603-72","unstructured":"Terashima-Marin, H. T., Ross, P., & Valenzuela-Rendon, M. (1999). Evolution of constraint satisfaction strategies in examination timetabling. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201999) (pp. 635-642)."},{"key":"jamc.2010102603-73","doi-asserted-by":"crossref","unstructured":"Tereshima-Marin, H. T., Zarate, C. J. F., Ross, P., & Valenzuela-Rendon, M. (2007). Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201907) (pp. 2182-2189).","DOI":"10.1145\/1276958.1277377"},{"key":"jamc.2010102603-74","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00101-9"},{"key":"jamc.2010102603-75","unstructured":"Vazquez-Rodriguez, J. A., Petrovic, S., & Salhi, A. (2007). A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines. In P. Baptiste, G. Kendall, A. Munier-Kordon, & F. Sourd (Eds.), Proceedings of the 3rd Multi-disciplinary International Scheduling Conference: Theory and Applications (MISTA\u201907), Paris (pp. 506-513)."},{"key":"jamc.2010102603-76","first-page":"726","article-title":"Final exam timetabling: a practical approach. In","volume":"2","author":"T.Wong","year":"2002","journal-title":"Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=40907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:31:49Z","timestamp":1654119109000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2010102603"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2010102603","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}