{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:19:28Z","timestamp":1744258768203,"version":"3.40.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-17-0568"],"award-info":[{"award-number":["APVV-17-0568"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0177\/21"],"award-info":[{"award-number":["1\/0177\/21"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["LP2016-3\/2020","K128611"],"award-info":[{"award-number":["LP2016-3\/2020","K128611"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["K128611"],"award-info":[{"award-number":["K128611"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0265\/17"],"award-info":[{"award-number":["1\/0265\/17"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA16228"],"award-info":[{"award-number":["CA16228"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["ITMS:313011D232"],"award-info":[{"award-number":["ITMS:313011D232"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10951-022-00752-8","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T19:12:25Z","timestamp":1664305945000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A quest for a fair schedule: The International Young Physicists\u2019 Tournament"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9641-1351","authenticated-orcid":false,"given":"Katar\u00edna","family":"Cechl\u00e1rov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1gnes","family":"Cseh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsuzsanna","family":"Jank\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00e1n","family":"Kire\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Mi\u0148o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,27]]},"reference":[{"key":"752_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"2018","author":"RA Ach\u00e1","year":"2014","unstructured":"Ach\u00e1, R. A., & Nieuwenhuis, R. (2014). Curriculum-based course timetabling with SAT and MaxSAT. Annals of Operations Research, 2018, 71\u201391.","journal-title":"Annals of Operations Research"},{"key":"752_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cor.2018.06.003","volume":"99","author":"T Atan","year":"2018","unstructured":"Atan, T., & \u00c7avdaro\u01e7lu, B. (2018). Minimization of rest mismatches in round robin tournaments. Computers & Operations Research, 99, 78\u201389.","journal-title":"Computers & Operations Research"},{"key":"752_CR3","volume-title":"Constraint-based scheduling: Applying constraint programming to scheduling problems","author":"P Baptiste","year":"2012","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2012). Constraint-based scheduling: Applying constraint programming to scheduling problems (Vol. 39). Springer Science & Business Media."},{"key":"752_CR4","unstructured":"Berkelaar, M., Dirks, J., Eikland, K., Notebaert, P., Ebert, J., Gourvest, V. (2007). lpsolve: A mixed integer linear programming (MILP) solver. http:\/\/sourceforge.net\/projects\/lpsolve Last accessed on January 8, 2021."},{"issue":"4","key":"752_CR5","first-page":"44","volume":"51","author":"M Bradbury","year":"2017","unstructured":"Bradbury, M., et al. (2017). JA Thompson history debating competition 2017. Teaching History, 51(4), 44\u201345.","journal-title":"Teaching History"},{"key":"752_CR6","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.cor.2007.11.002","volume":"36","author":"D Briskorn","year":"2009","unstructured":"Briskorn, D., & Drexl, A. (2009). IP models for round robin tournaments. Computers & Operations Research, 36, 837\u2013852.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"752_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dam.2009.08.006","volume":"158","author":"D Briskorn","year":"2010","unstructured":"Briskorn, D., & Knust, S. (2010). Constructing fair sports league schedules with regard to strength groups. Discrete Applied Mathematics, 158(2), 123\u2013135.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"752_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.orhc.2014.08.003","volume":"3","author":"R Bruni","year":"2014","unstructured":"Bruni, R., & Detti, P. (2014). A flexible discrete optimization approach to the physician scheduling problem. Operations Research for Health Care, 3(4), 191\u2013199.","journal-title":"Operations Research for Health Care"},{"key":"752_CR9","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R. (2005). Graph Theory. Springer."},{"issue":"5","key":"752_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.omega.2005.08.002","volume":"35","author":"A Drexl","year":"2007","unstructured":"Drexl, A., & Knust, S. (2007). Sports league scheduling: Graph-and resource-based models. Omega, 35(5), 465\u2013471.","journal-title":"Omega"},{"issue":"2","key":"752_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/inte.2020.1048","volume":"51","author":"GA Dur\u00e1n","year":"2021","unstructured":"Dur\u00e1n, G. A., Guajardo, M., L\u00f3pez, A. F., Marenco, J., & Zamorano, G. A. (2021). Scheduling multiple sports leagues with travel distance fairness: An application to Argentinean youth football. INFORMS Journal on Applied Analytics, 51(2), 136\u2013149.","journal-title":"INFORMS Journal on Applied Analytics"},{"issue":"4","key":"752_CR12","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5(4), 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"752_CR13","unstructured":"Goossens, D., Yi, X., Van\u00a0Bulck. D. (2020). Fairness trade-offs in sports timetabling. In Ley, Christophe and Dominicy, Yves, (Eds.), Science meets sports: When statistics are more than numbers, pp 213\u2013244. Cambridge Scholars"},{"issue":"4","key":"752_CR14","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.3934\/jimo.2018110","volume":"15","author":"D G\u00fcnne\u00e7","year":"2019","unstructured":"G\u00fcnne\u00e7, D., & Demir, E. (2019). Fair-fixture: Minimizing carry-over effects in football leagues. Journal of Industrial & Management Optimization, 15(4), 1565.","journal-title":"Journal of Industrial & Management Optimization"},{"key":"752_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P. (1935). On representatives of subsets. Journal of the London Mathematical Society, 10, 26\u201330.","journal-title":"Journal of the London Mathematical Society"},{"issue":"4","key":"752_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., & Karp, R. M. (1973). An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4), 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"752_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.03.038","volume":"254","author":"T Januario","year":"2016","unstructured":"Januario, T., Urrutia, S., Ribeiro, C. C., & de Werra, D. (2016). Edge coloring: A natural model for sports scheduling. European Journal of Operational Research, 254, 1\u20138.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"752_CR18","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1007\/s00373-020-02217-1","volume":"36","author":"B Keszegh","year":"2020","unstructured":"Keszegh, B. (2020). Two-coloring triples such that in each color class every element is missed at least once. Graphs and Combinatorics, 36(6), 1783\u20131795.","journal-title":"Graphs and Combinatorics"},{"key":"752_CR19","first-page":"104","volume":"34","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D. (1916). Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re (Hungarian). Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6, 34, 104\u2013119.","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6"},{"key":"752_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2010.04.012","volume":"38","author":"R Lewis","year":"2011","unstructured":"Lewis, R., & Thompson, J. (2011). On the application of graph colouring techniques in round-robin sports scheduling. Computers & Operations Research, 38, 190\u2013204.","journal-title":"Computers & Operations Research"},{"key":"752_CR21","volume-title":"P\u00f3lya Urn Models","author":"HM Mahmoud","year":"2009","unstructured":"Mahmoud, H. M. (2009). P\u00f3lya Urn Models. CRC Press."},{"issue":"16","key":"752_CR22","doi-asserted-by":"publisher","first-page":"6674","DOI":"10.1016\/j.eswa.2013.06.019","volume":"40","author":"S Martin","year":"2013","unstructured":"Martin, S., Ouelhadj, D., Smet, P., Berghe, G. V., & \u00d6zcan, E. (2013). Cooperative search for fair nurse rosters. Expert Systems with Applications, 40(16), 6674\u20136683.","journal-title":"Expert Systems with Applications"},{"key":"752_CR23","doi-asserted-by":"crossref","unstructured":"Miyashiro, R., & Matsui, T. (2005). A polynomial-time algorithm to find an equitable home-away assignment. Operations Research Letters, 33, 235\u2013241.","DOI":"10.1016\/j.orl.2004.06.004"},{"issue":"1","key":"752_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-014-1553-2","volume":"239","author":"M M\u00fchlenthaler","year":"2016","unstructured":"M\u00fchlenthaler, M., & Wanka, R. (2016). Fairness in academic course timetabling. Annals of Operations Research, 239(1), 171\u2013188.","journal-title":"Annals of Operations Research"},{"key":"752_CR25","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.asoc.2017.01.026","volume":"55","author":"A Muklason","year":"2017","unstructured":"Muklason, A., Parkes, A. J., \u00d6zcan, E., McCollum, B., & McMullan, P. (2017). Fairness in examination timetabling: Student preferences and extended formulations. Applied Soft Computing, 55, 302\u2013318.","journal-title":"Applied Soft Computing"},{"key":"752_CR26","unstructured":"Neumann, S., Wiese, A. (2016). This house proves that debating is harder than soccer. In E.\u00a0D. Demaine and F.\u00a0Grandoni, editors, 8th International Conference on Fun with Algorithms (FUN 2016), volume\u00a049 of Leibniz International Proceedings in Informatics (LIPIcs), pp 25:1\u201325:14, Dagstuhl, Germany. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. URL http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5871."},{"issue":"5","key":"752_CR27","first-page":"761","volume":"34","author":"H Pang","year":"2018","unstructured":"Pang, H., Wang, J.-S., Li, S.-X., Wang, J., Li, L., & Zhang, Y. (2018). Role of debating competition in medical immunology teaching. Chinese Journal of Immunology, 34(5), 761\u2013764.","journal-title":"Chinese Journal of Immunology"},{"key":"752_CR28","doi-asserted-by":"crossref","unstructured":"Queyranne, M., Spieksma, F. (2001). Multi-index transportation problems. In Encyclopedia of Optimization, pp 450\u2013456. Kluwer.","DOI":"10.1007\/0-306-48332-7_307"},{"key":"752_CR29","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1287\/inte.1110.0566","volume":"42","author":"C Ribeiro","year":"2009","unstructured":"Ribeiro, C., & Urrutia, S. (2009). Scheduling the Brazilian soccer tournament by integer programming maximizing audience shares under fairness constraints. Interfaces, 42, 260\u2013272.","journal-title":"Interfaces"},{"key":"752_CR30","unstructured":"Spies-Butcher, B.(2007). Debating and public speaking as oral literary: Promoting democratic education. In National Conference on Future Directions in Literacy, pp 269\u2013279. Sydney University Press."},{"issue":"3","key":"752_CR31","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.ejor.2011.10.038","volume":"219","author":"R Stolletz","year":"2012","unstructured":"Stolletz, R., & Brunner, J. O. (2012). Fair optimization of fortnightly physician schedules with flexible shifts. European Journal of Operational Research, 219(3), 622\u2013629.","journal-title":"European Journal of Operational Research"},{"key":"752_CR32","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.orl.2015.12.008","volume":"44","author":"W Suksompong","year":"2016","unstructured":"Suksompong, W. (2016). Scheduling asynchronous round-robin tournaments. Operations Research Letters, 44, 96\u2013100.","journal-title":"Operations Research Letters"},{"key":"752_CR33","unstructured":"The World Universities Debating Championships. (2014). Debating and judging manual. https:\/\/debate.uvm.edu\/ Last accessed on January 8, 2021."},{"issue":"3","key":"752_CR34","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences, 10(3), 384\u2013393.","journal-title":"Journal of Computer and System Sciences"},{"key":"752_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104856","volume":"115","author":"D Van Bulck","year":"2020","unstructured":"Van Bulck, D., & Goossens, D. (2020). Handling fairness issues in time-relaxed tournaments with availability constraints. Computers & Operations Research, 115, 104856.","journal-title":"Computers & Operations Research"},{"issue":"5","key":"752_CR36","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.orl.2013.06.007","volume":"41","author":"L Zeng","year":"2013","unstructured":"Zeng, L., & Mizuno, S. (2013). Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks. Operations Research Letters, 41(5), 506\u2013510.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00752-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00752-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00752-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:47:45Z","timestamp":1744206465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00752-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["752"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00752-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,9,27]]},"assertion":[{"value":"11 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}