{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T05:35:56Z","timestamp":1773898556771,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}],"id":[{"id":"10.13039\/501100003246","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,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A popular approach to construct a schedule for a round-robin tournament is known as first-break, then-schedule. Thus, when given a home away pattern (HAP) for each team, which specifies for each round whether the team plays a home game or an away game, the remaining challenge is to find a round for each match that is compatible with both team\u2019s patterns. When using such an approach, it matters how many rounds are available for each match: the more rounds are available for a match, the more options exist to accommodate particular constraints. We investigate the notion of flexibility of a set of HAPs and introduce a number of measures assessing this flexibility. We show how the so-called canonical pattern set (CPS) behaves on these measures, and, by solving integer programs, we give explicit values for all single-break HAP sets with at most 16 teams.<\/jats:p>","DOI":"10.1007\/s10951-022-00734-w","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T09:02:40Z","timestamp":1649754160000},"page":"413-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The flexibility of home away pattern sets"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0314-6094","authenticated-orcid":false,"given":"Roel","family":"Lambers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dries","family":"Goossens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"key":"734_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2007.09.009","volume":"36","author":"D Briskorn","year":"2008","unstructured":"Briskorn, D. (2008). Feasibility of home-away pattern sets for round robin tournaments. Operations Research Letters, 36, 283\u2013284.","journal-title":"Operations Research Letters"},{"key":"734_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.orl.2020.02.004","volume":"48","author":"M Davari","year":"2020","unstructured":"Davari, M., Goossens, D., Beli\u00ebn, J., Lambers, R., & Spieksma, F. C. R. (2020). The multi-league sports scheduling problem, or how to schedule thousands of matches. Operations Research Letters, 48, 180\u2013187.","journal-title":"Operations Research Letters"},{"key":"734_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D de Werra","year":"1980","unstructured":"de Werra, D. (1980). Geography, games, and graphs. Discrete Applied Mathematics, 2, 327\u2013337.","journal-title":"Discrete Applied Mathematics"},{"key":"734_CR4","doi-asserted-by":"crossref","unstructured":"de Werra, D. (1981). Scheduling in sports. In P. Hansen (Ed.), Studies on graphs and discrete programming (pp. 381\u2013395). Berlin: Springer.","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"734_CR5","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, 465\u2013471.","journal-title":"Omega"},{"key":"734_CR6","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.orl.2011.09.001","volume":"39","author":"D Goossens","year":"2011","unstructured":"Goossens, D., & Spieksma, F. C. R. (2011). Breaks, cuts, and patterns. Operations Research Letters, 39, 428\u2013432.","journal-title":"Operations Research Letters"},{"key":"734_CR7","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10951-011-0238-9","volume":"15","author":"D Goossens","year":"2012","unstructured":"Goossens, D., & Spieksma, F. C. R. (2012). Soccer schedules in Europe: An overview. Journal of Scheduling, 15, 641\u2013651.","journal-title":"Journal of Scheduling"},{"key":"734_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.orl.2009.10.008","volume":"38","author":"A Horbach","year":"2010","unstructured":"Horbach, A. (2010). A combinatorial property of the maximum round robin tournament problem. Operations Research Letters, 38, 121\u2013122.","journal-title":"Operations Research Letters"},{"key":"734_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall, G., Knust, S., Ribeiro, C. C., & Urrutia, S. (2010). Scheduling in sports: An annotated bibliography. Computers and Operations Research, 37, 1\u201319.","journal-title":"Computers and Operations Research"},{"key":"734_CR10","unstructured":"https:\/\/www.knltb.nl\/tennissers\/competitie\/voorjaarscompetitie\/eredivisie\/eredivisie-heren\/. Accessed 27 September 2019."},{"key":"734_CR11","doi-asserted-by":"publisher","first-page":"2937","DOI":"10.1016\/j.cor.2009.01.004","volume":"36","author":"S Knust","year":"2009","unstructured":"Knust, S., & L\u00fccking, D. (2009). Minimizing costs in round robin tournaments with place constraints. Computers and Operations Research, 36, 2937\u20132943.","journal-title":"Computers and Operations Research"},{"key":"734_CR12","unstructured":"Lambers, R., Nederlof, J., & Spieksma, F. C. R. (2020). How the schedule in the TATA Steel Chess Championship forced Carlsen to help Caruana win, https:\/\/www.networkpages.nl\/how-the-schedule-in-the-tata-steel-chess-championship-forced-carlsen-to-help-caruana-win\/. Accessed 26 August 2021."},{"key":"734_CR13","doi-asserted-by":"crossref","unstructured":"Miyashiro, R., Iwasaki, H., & Matsui, T. (2003) Characterizing feasible pattern sets with a minimum number of breaks, In Burke E., De Causmaecker P. (Eds.) Practice and theory of automated timetabling IV (vol. 2740, pp. 78\u201399). PATAT 2002. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-45157-0_5"},{"key":"734_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser, G. L., & Trick, M. A. (1998). Scheduling a major college basketball conference. Operations Research, 46, 1\u20138.","journal-title":"Operations Research"},{"key":"734_CR15","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R Rasmussen","year":"2008","unstructured":"Rasmussen, R., & Trick, M. A. (2008). Round robin scheduling: A survey. European Journal of Operational Research, 188, 617\u2013636.","journal-title":"European Journal of Operational Research"},{"key":"734_CR16","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.ejor.2019.07.023","volume":"280","author":"D Van Bulck","year":"2020","unstructured":"Van Bulck, D., Goossens, D., Sch\u00f6nberger, J., & Guajardo, M. (2020). RobinX: A three-field classification and unified data format for round-robin sports timetabling. European Journal of Operational Research, 280, 568\u2013580.","journal-title":"European Journal of Operational Research"},{"key":"734_CR17","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.orl.2010.08.008","volume":"38","author":"P van \u2019t Hof","year":"2010","unstructured":"van \u2019t Hof, P., Post, G., & Briskorn, D. (2010). Constructing fair round robin tournaments with a minimum number of breaks. Operations Research Letters, 38, 592\u2013596.","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-00734-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00734-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00734-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T05:06:32Z","timestamp":1694840792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00734-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["734"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00734-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1206422\/v1","asserted-by":"object"}]},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]},"assertion":[{"value":"10 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}