{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:07:05Z","timestamp":1742987225704,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_42","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"724-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork"],"prefix":"10.1007","author":[{"given":"Begum","family":"Genc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"42_CR1","unstructured":"Localsolver 9.0 (2019). http:\/\/www.localsolver.com\/"},{"key":"42_CR2","unstructured":"Adeyemo, A.: Fragmentable group and item bin packing with compatibility preferences. In: Proceedings of the 2015 International Conference on Industrial Engineering and Operations Management (2015)"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-015-1832-6","volume":"229","author":"T Arbaoui","year":"2015","unstructured":"Arbaoui, T., Boufflet, J.P., Moukrim, A.: Preprocessing and an improved MIP model for examination timetabling. Ann. Oper. Res. 229(1), 19\u201340 (2015)","journal-title":"Ann. Oper. Res."},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11593577_19","volume-title":"Practice and Theory of Automated Timetabling V","author":"H Asmuni","year":"2005","unstructured":"Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: Fuzzy multiple heuristic orderings for examination timetabling. In: Burke, E., Trick, M. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 334\u2013353. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593577_19"},{"key":"42_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: In European Conference on Artificial Intelligence (ECAI 2004) (2004)"},{"issue":"9","key":"42_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"5","key":"42_CR7","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s10732-018-9375-z","volume":"24","author":"B Byholm","year":"2018","unstructured":"Byholm, B., Porres, I.: Fast algorithms for fragmentable items bin packing. J. Heuristics 24(5), 697\u2013723 (2018)","journal-title":"J. Heuristics"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61794-9_49","volume-title":"Practice and Theory of Automated Timetabling","author":"MW Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G.: Recent developments in practical examination timetabling. In: Burke, E., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 1\u201321. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61794-9_49"},{"issue":"3","key":"42_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1287\/inte.24.3.109","volume":"24","author":"MW Carter","year":"1994","unstructured":"Carter, M.W., Laporte, G., Chinneck, J.W.: A general examination scheduling system. Interfaces 24(3), 109\u2013120 (1994)","journal-title":"Interfaces"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.12.008","volume":"46","author":"M Casazza","year":"2014","unstructured":"Casazza, M., Ceselli, A.: Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46, 1\u201311 (2014)","journal-title":"Comput. Oper. Res."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cor.2016.06.007","volume":"75","author":"M Casazza","year":"2016","unstructured":"Casazza, M., Ceselli, A.: Exactly solving packing problems with fragmentation. Comput. Oper. Res. 75, 202\u2013213 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10479-016-2321-2","volume":"258","author":"A Cataldo","year":"2017","unstructured":"Cataldo, A., Ferrer, J.C., Miranda, J., Rey, P.A., Saur\u00e9, A.: An integer programming approach to curriculum-based examination timetabling. Ann. Oper. Res. 258(2), 369\u2013393 (2017)","journal-title":"Ann. Oper. Res."},{"key":"42_CR13","first-page":"423","volume":"3867","author":"P De Haan","year":"2006","unstructured":"De Haan, P., Landman, R., Post, G., Ruizenaar, H.: A four-phase approach to a timetabling problem in secondary schools. Pract. Theory Autom. Timetabling VI 3867, 423\u2013425 (2006)","journal-title":"Pract. Theory Autom. Timetabling VI"},{"key":"42_CR14","unstructured":"Duong, T.A., Lam, K.H.: Combining constraint programming and simulated annealing on university exam timetabling. In: RIVF, pp. 205\u2013210. Citeseer (2004)"},{"key":"42_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10479-010-0712-3","volume":"194","author":"C Gogos","year":"2012","unstructured":"Gogos, C., Alefragis, P., Housos, E.: An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Ann. Oper. Res. 194(1), 203\u2013221 (2012)","journal-title":"Ann. Oper. Res."},{"key":"42_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-85958-1_24","volume-title":"CP 2008","author":"E Hebrard","year":"2008","unstructured":"Hebrard, E., O\u2019Sullivan, B., Razgon, I.: A soft constraint of equality: complexity and approximability. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 358\u2013371. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_24"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cie.2018.11.037","volume":"127","author":"OA Kasm","year":"2019","unstructured":"Kasm, O.A., Mohandes, B., Diabat, A., El Khatib, S.: Exam timetabling with allowable conflicts within a time window. Comput. Indu. Eng. 127, 263\u2013273 (2019)","journal-title":"Comput. Indu. Eng."},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2015.08.005","volume":"602","author":"B LeCun","year":"2015","unstructured":"LeCun, B., Mautor, T., Quessette, F., Weisser, M.A.: Bin packing with fragmentable items: presentation and approximations. Theor. Comput. Sci. 602, 50\u201359 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"42_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1057\/jors.1991.42","volume":"42","author":"V Lotfi","year":"1991","unstructured":"Lotfi, V., Cerveny, R.: A final-exam-scheduling package. J. Oper. Res. Soc. 42(3), 205\u2013216 (1991)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"42_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0898-1221(98)00087-X","volume":"35","author":"CA Mandal","year":"1998","unstructured":"Mandal, C.A., Chakrabarti, P.P., Ghose, S.: Complexity of fragmentable object bin packing and an application. Comput. Math. Appl. 35(11), 91\u201397 (1998)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10479-011-0997-x","volume":"194","author":"B McCollum","year":"2012","unstructured":"McCollum, B., McMullan, P., Parkes, A.J., Burke, E.K., Qu, R.: A new model for automated examination timetabling. Ann. Oper. Res. 194(1), 291\u2013315 (2012)","journal-title":"Ann. Oper. Res."},{"key":"42_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"LTG Merlot","year":"2003","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 207\u2013231. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45157-0_14"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Michail, D., Kinable, J., Naveh, B., Sichi, J.V.: JGrapht-A Java library for graph data structures and algorithms. arXiv preprint arXiv:1904.08355 (2019)","DOI":"10.1145\/3381449"},{"key":"42_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_15"},{"issue":"5","key":"42_CR26","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1287\/opre.24.5.857","volume":"24","author":"HE Miller","year":"1976","unstructured":"Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Oper. Res. 24(5), 857\u2013870 (1976)","journal-title":"Oper. Res."},{"issue":"11","key":"42_CR27","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1057\/palgrave.jors.2601628","volume":"54","author":"SK Mirrazavi","year":"2003","unstructured":"Mirrazavi, S.K., Mardle, S.J., Tamiz, M.: A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies. J. Oper. Res. Soc. 54(11), 1155\u20131166 (2003)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"42_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10951-014-0391-z","volume":"19","author":"T M\u00fcller","year":"2016","unstructured":"M\u00fcller, T.: Real-life examination timetabling. J. Sched. 19(3), 257\u2013270 (2016)","journal-title":"J. Sched."},{"issue":"2","key":"42_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.asoc.2009.08.011","volume":"10","author":"N Pillay","year":"2010","unstructured":"Pillay, N., Banzhaf, W.: An informed genetic algorithm for the examination timetabling problem. Appl. Soft Comput. 10(2), 457\u2013467 (2010). https:\/\/doi.org\/10.1016\/j.asoc.2009.08.011","journal-title":"Appl. Soft Comput."},{"key":"42_CR30","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco Documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017). http:\/\/www.choco-solver.org"},{"issue":"1","key":"42_CR31","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu, R., Burke, E.K., McCollum, B., Merlot, L.T., Lee, S.Y.: A survey of search methodologies and automated system development for examination timetabling. J. Sched. 12(1), 55\u201389 (2009)","journal-title":"J. Sched."},{"key":"42_CR32","first-page":"362","volume":"94","author":"JC R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. AAAI. 94, 362\u2013367 (1994)","journal-title":"AAAI."},{"key":"42_CR33","unstructured":"Ribi\u0107, S., Konjicija, S.: A two phase integer linear programming approach to solving the school timetable problem. In: Proceedings of the ITI 2010, 32nd International Conference on Information Technology Interfaces, pp. 651\u2013656. IEEE (2010)"},{"issue":"2","key":"42_CR34","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87\u2013127 (1999)","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"42_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00224-007-9082-x","volume":"43","author":"H Shachnai","year":"2008","unstructured":"Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. Theory Comput. Syst. 43(1), 81\u201398 (2008)","journal-title":"Theory Comput. Syst."},{"key":"42_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-540-30201-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Shaw","year":"2004","unstructured":"Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648\u2013662. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_47"},{"key":"42_CR37","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.cie.2019.02.050","volume":"130","author":"P Yasari","year":"2019","unstructured":"Yasari, P., Ranjbar, M., Jamili, N., Shaelaie, M.H.: A two-stage stochastic programming approach for a multi-objective course timetabling problem with courses cancelation risk. Comput. Ind. Eng. 130, 650\u2013660 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"10","key":"42_CR38","doi-asserted-by":"publisher","first-page":"4712","DOI":"10.1109\/TII.2018.2851241","volume":"14","author":"L Yin","year":"2018","unstructured":"Yin, L., Luo, J., Luo, H.: Tasks scheduling and resource allocation in fog computing based on containers for smart manufacturing. IEEE Trans. Indu. Inf. 14(10), 4712\u20134721 (2018)","journal-title":"IEEE Trans. Indu. Inf."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:55:18Z","timestamp":1619189718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","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":"122","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":"55","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":"0","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":"45% - 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":"3.13","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":"3.47","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}