{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:53:39Z","timestamp":1772297619695,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T00:00:00Z","timestamp":1311897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10951-011-0244-y","type":"journal-article","created":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T15:52:01Z","timestamp":1311868321000},"page":"655-667","source":"Crossref","is-referenced-by-count":27,"title":["A heuristic for minimizing weighted carry-over effects in round robin tournaments"],"prefix":"10.1007","volume":"14","author":[{"given":"Allison C. B.","family":"Guedes","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,29]]},"reference":[{"key":"244_CR1","series-title":"CRC research notes in mathematics","first-page":"1","volume-title":"Combinatorial designs and their applications","author":"I. Anderson","year":"1999","unstructured":"Anderson, I. (1999). Balancing carry-over effects in tournaments. In F.\u00a0Holroyd, K. Quinn, C. Rowley, & B. Webb (Eds.), CRC research notes in mathematics. Combinatorial designs and their applications (pp. 1\u201316). London: Chapman & Hall."},{"key":"244_CR2","volume-title":"Proceedings of the 7th international conference on the practice and theory of automated timetabling","author":"F. N. Costa","year":"2008","unstructured":"Costa, F. N., Urrutia, S., & Ribeiro, C. C. (2008). An ILS heuristic for the traveling tournament problem with fixed venues. In E. K. Burke & M. Gendreau (Eds.), Proceedings of the 7th international conference on the practice and theory of automated timetabling, Montr\u00e9al"},{"key":"244_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D. Werra de","year":"1980","unstructured":"de Werra, D. (1980). Geography, games and graphs. Discrete Applied Mathematics, 2, 327\u2013337.","journal-title":"Discrete Applied Mathematics"},{"key":"244_CR4","series-title":"Annals of discrete mathematics","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0304-0208(08)73478-9","volume-title":"Studies on graphs and discrete programming","author":"D. Werra de","year":"1981","unstructured":"de Werra, D. (1981). Scheduling in sports. In P. Hansen (Ed.), Annals of discrete mathematics: Vol. 11. Studies on graphs and discrete programming (pp. 381\u2013395). Amsterdam: North-Holland."},{"key":"244_CR5","series-title":"The CRC press series on discrete mathematics and its applications","first-page":"467","volume-title":"The CRC handbook of combinatorial designs","author":"J. H. Dinitz","year":"1996","unstructured":"Dinitz, J. H. (1996). Starters. In C. J. Colbourn & J. H. Dinitz (Eds.), The CRC press series on discrete mathematics and its applications. The CRC handbook of combinatorial designs (pp. 467\u2013473). Boca Raton: CRC Press."},{"key":"244_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-540-77345-0_11","volume-title":"Practice and theory of automated timetabling VI","author":"A. R. Duarte","year":"2007","unstructured":"Duarte, A. R., Ribeiro, C. C., Urrutia, S., & Haeusler, E. (2007). Referee assignment in sports leagues. In Lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling VI (pp. 158\u2013173). Berlin: Springer."},{"key":"244_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/3-540-45578-7_43","volume-title":"Principles and practice of constraint programming","author":"K. Easton","year":"2001","unstructured":"Easton, K., Nemhauser, G., & Trick, M. A. (2001). The travelling tournament problem: description and benchmarks. In T. Walsh (Ed.), Lecture notes in computer science: Vol. 2239. Principles and practice of constraint programming (pp. 580\u2013585). Berlin: Springer."},{"key":"244_CR8","first-page":"240","volume-title":"Book of abstracts of the 23rd European conference on operational research","author":"T. Flatberg","year":"2009","unstructured":"Flatberg, T., Nilssen, E., & St\u00f8levik, M. (2009). Scheduling the topmost football leagues of Norway. In Book of abstracts of the 23rd European conference on operational research, Bonn (p.\u00a0240)."},{"key":"244_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"244_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic."},{"issue":"3","key":"244_CR11","first-page":"653","volume":"29","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., & Mart\u00ed, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3), 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"244_CR12","unstructured":"Goodbread, C. (2010). SEC aims to fix schedule problem by month\u2019s end. Online reference at http:\/\/www.tidesports.com\/article\/20100409\/NEWS\/100409591 , last visited on August 14, 2010."},{"key":"244_CR13","first-page":"288","volume-title":"Book of abstracts of the 23rd European conference on operational research","author":"D. Goossens","year":"2009","unstructured":"Goossens, D., & Spieksma, F. (2009). Does the carry-over effect exist? In Book of abstracts of the 23rd European conference on operational research, Bonn (p.\u00a0288)."},{"key":"244_CR14","volume-title":"The traveling salesman problem and its variations","year":"2002","unstructured":"Gutin, G., & Punnen, P. (Eds.) (2002). The traveling salesman problem and its variations. Dordrecht: Kluwer Academic."},{"key":"244_CR15","first-page":"145","volume-title":"Handbook of metaheuristics","author":"P. Hansen","year":"2002","unstructured":"Hansen, P., & Mladenovic, N. (2002). Variable neighborhood search. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 145\u2013184). Dordrecht: Kluwer Academic."},{"key":"244_CR16","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/S0377-2217(03)00101-2","volume":"153","author":"M. Henz","year":"2004","unstructured":"Henz, M., M\u00fcller, T., & Thiel, S. (2004). Global constraints for round robin tournament scheduling. European Journal of Operational Research, 153, 92\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"244_CR17","doi-asserted-by":"crossref","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\u00a0annotated bibliography. Computers & Operations Research, 37, 1\u201319.","journal-title":"Computers & Operations Research"},{"key":"244_CR18","first-page":"191","volume":"2","author":"T. Kirkman","year":"1847","unstructured":"Kirkman, T. (1847). On a problem in combinations. Cambridge Dublin Mathematical Journal, 2, 191\u2013204.","journal-title":"Cambridge Dublin Mathematical Journal"},{"key":"244_CR19","volume-title":"The traveling salesman problem: a\u00a0guided tour of combinatorial optimization","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (Eds.) (1985). The traveling salesman problem: a\u00a0guided tour of combinatorial optimization. New York: Wiley."},{"key":"244_CR20","first-page":"321","volume-title":"Handbook of metaheuristics","author":"H. R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & Stutzle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321\u2013353). Dordrecht: Kluwer Academic."},{"key":"244_CR21","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10898-009-9430-2","volume":"46","author":"A. P. Lucena","year":"2010","unstructured":"Lucena, A. P., Ribeiro, C. C., & Santos, A. C. (2010) A hybrid heuristic for the diameter constrained minimum spanning tree problem. Journal of Global Optimization, 46, 363\u2013381.","journal-title":"Journal of Global Optimization"},{"key":"244_CR22","first-page":"299","volume":"5","author":"O. C. Martin","year":"1991","unstructured":"Martin, O. C., Otto, S. W., & Felten, E. W. (1991). Large-step Markov chains for the traveling salesman problem. Complex Systems, 5, 299\u2013326.","journal-title":"Complex Systems"},{"key":"244_CR23","first-page":"460","volume-title":"Proceedings of the 6th international conference on the practice and theory of automated timetabling","author":"R. Miyashiro","year":"2006","unstructured":"Miyashiro, R., & Matsui, T. (2006). Minimizing the carry-over effects value in a round robin tournament. In Proceedings of the 6th international conference on the practice and theory of automated timetabling, Brno (pp.\u00a0460\u2013463)."},{"key":"244_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"34","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 34, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"244_CR25","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-77345-0_12","volume-title":"Practice and theory of automated timetabling VI","author":"T. F. Noronha","year":"2007","unstructured":"Noronha, T. F., Ribeiro, C. C., Duran, G., Souyris, S., & Weintraub, A. (2007). A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament. In Lecture notes in computer science: Vol.\u00a03867. Practice and theory of automated timetabling VI (pp. 174\u2013186). Berlin: Springer."},{"key":"244_CR26","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R. V. Rasmussen","year":"2008","unstructured":"Rasmussen, R. V., & Trick, M. A. (2008). Round robin scheduling\u2014a survey. European Journal of Operational Research, 188, 617\u2013636.","journal-title":"European Journal of Operational Research"},{"key":"244_CR27","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-77345-0_10","volume-title":"Practice and theory of automated timetabling VI","author":"C. C. Ribeiro","year":"2007","unstructured":"Ribeiro, C. C., & Urrutia, S. (2007a). Scheduling the Brazilian soccer tournament with fairness and broadcast objectives. In Lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling VI (pp. 147\u2013157). Berlin: Springer."},{"key":"244_CR28","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.ejor.2005.03.061","volume":"179","author":"C. C. Ribeiro","year":"2007","unstructured":"Ribeiro, C. C., & Urrutia, S. (2007b). Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research, 179, 775\u2013787.","journal-title":"European Journal of Operational Research"},{"key":"244_CR29","first-page":"46","volume-title":"Proceedings of the third international conference on management science and engineering management","author":"C. Ribeiro","year":"2009","unstructured":"Ribeiro, C., & Urrutia, S. (2009c). Bicriteria integer programming approach for scheduling the Brazilian national soccer tournament. In\u00a0Proceedings of the third international conference on management science and engineering management, Bangkok (pp.\u00a046\u201349)."},{"key":"244_CR30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1093\/biomet\/67.1.127","volume":"67","author":"K. G. Russell","year":"1980","unstructured":"Russell, K. G. (1980). Balancing carry-over effects in round robin tournaments. Biometrika, 67, 127\u2013131.","journal-title":"Biometrika"},{"key":"244_CR31","series-title":"Lecture notes in computer sciences","first-page":"242","volume-title":"Selected papers from the third international conference on practice and theory of automated timetabling III","author":"M. A. Trick","year":"2000","unstructured":"Trick, M. A. (2000). A schedule-then-break approach to sports timetabling. In E. Burke & W. Erben (Eds.), Lecture notes in computer sciences: Vol. 2079. Selected papers from the third international conference on practice and theory of automated timetabling III (pp. 242\u2013253). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0244-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0244-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0244-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0244-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,29]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["244"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0244-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,29]]}}}