dc.contributor.author | Atan, Sabri Tankut | en_US |
dc.contributor.author | Çavdaroğlu, Burak | en_US |
dc.date.accessioned | 2018-12-07T02:17:41Z | |
dc.date.available | 2018-12-07T02:17:41Z | |
dc.date.issued | 2018-11-01 | |
dc.identifier.citation | Atan, S. T. & Çavdaroğlu, B. (2018). Minimization of rest mismatches in round robin tournaments. Computers and Operations Research, 99, 78-89. doi:10.1016/j.cor.2018.06.003 | en_US |
dc.identifier.issn | 0305-0548 | |
dc.identifier.issn | 1873-765X | |
dc.identifier.uri | https://hdl.handle.net/11729/1400 | |
dc.identifier.uri | http://dx.doi.org/10.1016/j.cor.2018.06.003 | |
dc.description.abstract | In sports tournaments, an occurrence of a difference in the rest periods of opponent teams in a game, which we refer to as a rest mismatch, will disadvantage the less rested team. Thus, it is only fair to expect opposing teams to have rested equally before their game. In this work, we introduce and study the Rest Mismatch Problem where the goal is to minimize the number of rest mismatches in a round robin tournament. Two integer linear formulations and a constraint programming formulation are provided, and their computational performances are compared for several problem instances. Moreover, a heuristic algorithm is developed which finds a single round robin schedule with zero mismatches when the number of teams in the tournament is a multiple of 8, and four mismatches when it is a multiple of 4 but not 8. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Pergamon-Elsevier Science Ltd | en_US |
dc.relation.isversionof | 10.1016/j.cor.2018.06.003 | |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Round robin scheduling | en_US |
dc.subject | League fairness | en_US |
dc.subject | Rest mismatch | en_US |
dc.subject | Mixed-integer linear programming | en_US |
dc.subject | Constraint programming | en_US |
dc.subject | Near optimal solution | en_US |
dc.subject | Constraint | en_US |
dc.subject | Leagues | en_US |
dc.subject | Tennis | en_US |
dc.subject | Times | en_US |
dc.subject | SportS | en_US |
dc.subject | Cricket | en_US |
dc.subject | Traveling tournament | en_US |
dc.subject | Computer programming | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Integer programming | en_US |
dc.subject | Scheduling algorithms | en_US |
dc.subject | Routers | en_US |
dc.title | Minimization of rest mismatches in round robin tournaments | en_US |
dc.type | article | en_US |
dc.description.version | Publisher's Version | en_US |
dc.relation.journal | Computers and Operations Research | en_US |
dc.contributor.department | Işık Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.contributor.department | Işık University, Faculty of Engineering, Department of Industrial Engineering | en_US |
dc.contributor.authorID | 0000-0002-3241-4617 | |
dc.identifier.volume | 99 | |
dc.identifier.startpage | 78 | |
dc.identifier.endpage | 89 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.contributor.institutionauthor | Atan, Sabri Tankut | en_US |
dc.relation.index | WOS | en_US |
dc.relation.index | Scopus | en_US |
dc.relation.index | Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.description.quality | Q2 | |
dc.description.wosid | WOS:000442059400007 | |