کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
477405 1446159 2009 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Combinatorial properties of strength groups in round robin tournaments
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Combinatorial properties of strength groups in round robin tournaments
چکیده انگلیسی

A single round robin tournament (RRT) consists of a set T of n teams (n even) and a set P of n − 1 periods. The teams have to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period. In order to establish fairness among teams we consider a partition of teams into strength groups. Then, the goal is to avoid a team playing against extremely weak or extremely strong teams in consecutive periods. We propose two concepts ensuring different degrees of fairness. One question arising here is whether a single RRT exists for a given number of teams n and a given partition of the set of teams into strength groups or not. In this paper we examine this question. Furthermore, we analyse the computational complexity of cost minimization problems in the presence of strength group requirements.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 192, Issue 3, 1 February 2009, Pages 744–754
نویسندگان
,