{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:39:36Z","timestamp":1743143976685,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031364013"},{"type":"electronic","value":"9783031364020"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36402-0_53","type":"book-chapter","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T21:39:27Z","timestamp":1687556367000},"page":"569-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rescheduling Exams Within the Announced Tenure Using Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4813-0961","authenticated-orcid":false,"given":"Mohammed Ozair","family":"Omar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3361-3949","authenticated-orcid":false,"given":"D. Teja","family":"Santosh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7981-4020","authenticated-orcid":false,"given":"M.","family":"Raghava","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6890-1815","authenticated-orcid":false,"given":"Jyothirmai","family":"Joshi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77345-0","volume-title":"Practice and theory of automated timetabling VI","year":"2007","unstructured":"Burke, E.K., Rudov\u00e1, H. (eds.): PATAT 2006. LNCS, vol. 3867. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77345-0"},{"key":"53_CR2","unstructured":"Hamilton-Bryce, R., McMullan, P., McCollum, B.: Directed selection using reinforcement learning for the examination timetabling problem. In: Proceedings of the PATAT 14 (2014)"},{"key":"53_CR3","unstructured":"Han, K.: Using reinforcement learning in solving exam timetabling problems. Diss. Queen's University Belfast. Faculty of Engineering and Physical Sciences (2018)"},{"issue":"1","key":"53_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., et al.: Setting the research agenda in automated timetabling: The second international timetabling competition. Informs J. Comput. 22(1), 120\u2013130 (2010)","journal-title":"Informs J. Comput."},{"issue":"3","key":"53_CR5","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","volume-title":"Practice and Theory of Automated Timetabling III","author":"GM White","year":"2001","unstructured":"White, G.M., Xie, B.S.: Examination timetables and tabu search with longer-term memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 85\u2013103. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44629-X_6"},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-46004-7_13","volume-title":"Applications of Evolutionary Computing","author":"L Paquete","year":"2002","unstructured":"Paquete, L., St\u00fctzle, T.: An experimental investigation of iterated local search for coloring graphs. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 122\u2013131. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46004-7_13"},{"key":"53_CR8","doi-asserted-by":"publisher","unstructured":"Erg\u00fcl, A.: GA-based examination scheduling experience at Middle East Technical University. In: Burke, E., Ross, P. (eds.) Practice and Theory of Automated Timetabling. PATAT 1995. Lecture Notes in Computer Science, vol. 1153, pp. 212\u2013226. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61794-9_61","DOI":"10.1007\/3-540-61794-9_61"},{"key":"53_CR9","unstructured":"Paquete, L.F., Fonseca, C.M.: A study of examination timetabling with multiobjective evolutionary algorithms. In: Proceedings of the 4th Metaheuristics International Conference (MIC 2001) (2001)"},{"key":"53_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0055884","volume-title":"Practice and Theory of Automated Timetabling II","author":"P Ross","year":"1998","unstructured":"Ross, P., Hart, E., Corne, D.: Some observations about GA-based exam timetabling. In: Burke, E., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 115\u2013129. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055884"},{"key":"53_CR11","unstructured":"Ahmadi, S., et al.: Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In: Proceedings of Multidisciplinary International Scheduling: Theory and Applications (MISTA 2003), pp. 155\u2013171 (2003)"},{"key":"53_CR12","unstructured":"Ross, P., Mar\u00edn-Bl\u00e1zquez, J.G., Hart, E.: Hyper-heuristics applied to class and exam timetabling problems. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753). IEEE, vol. 2. (2004)"},{"key":"53_CR13","unstructured":"McCollum, B., et al.: An extended great deluge approach to the examination timetabling problem. In: Proceedings of the 4th Multidisciplinary International Scheduling: Theory and Applications 2009 (MISTA 2009), pp. 424\u2013434 (2009)"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Bai, R., et al.: A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR, 10, 43\u201366 (2012)","DOI":"10.1007\/s10288-011-0182-8"},{"key":"53_CR15","unstructured":"Burke, E., et al.: Using simulated annealing to study behaviour of various exam timetabling data sets (2003)"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., et al.: A reinforcement learning: great-deluge hyper-heuristic for examination timetabling. In: Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends. IGI Global, pp. 34\u201355 (2012)","DOI":"10.4018\/978-1-4666-0270-0.ch003"}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36402-0_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:15:01Z","timestamp":1687605301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36402-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031364013","9783031364020"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36402-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIWAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Multi-disciplinary Trends in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyberabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"miwai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"245","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 invited article","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}