{"title":"无连续休息时间循环赛的休息时间最大化","authors":"Fei Xue, Hajunfu Ma, Maiko Shigeno","doi":"10.1016/j.orl.2024.107200","DOIUrl":null,"url":null,"abstract":"<div><div>In sports scheduling, particularly for round-robin tournaments, an important objective is to create equitable game schedules. Our focus is on developing schedules that balance the number of home and away games to ensure fairness, while also maximizing the number of consecutive home games and consecutive away games, referred to as breaks. This paper establishes upper bounds for the number of breaks and demonstrates that these bounds are tight for up to 36 teams.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107200"},"PeriodicalIF":0.8000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Break maximization for round-robin tournaments without consecutive breaks\",\"authors\":\"Fei Xue, Hajunfu Ma, Maiko Shigeno\",\"doi\":\"10.1016/j.orl.2024.107200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In sports scheduling, particularly for round-robin tournaments, an important objective is to create equitable game schedules. Our focus is on developing schedules that balance the number of home and away games to ensure fairness, while also maximizing the number of consecutive home games and consecutive away games, referred to as breaks. This paper establishes upper bounds for the number of breaks and demonstrates that these bounds are tight for up to 36 teams.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"57 \",\"pages\":\"Article 107200\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724001366\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724001366","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Break maximization for round-robin tournaments without consecutive breaks
In sports scheduling, particularly for round-robin tournaments, an important objective is to create equitable game schedules. Our focus is on developing schedules that balance the number of home and away games to ensure fairness, while also maximizing the number of consecutive home games and consecutive away games, referred to as breaks. This paper establishes upper bounds for the number of breaks and demonstrates that these bounds are tight for up to 36 teams.
期刊介绍:
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.