查看文章

Sport tournament scheduling is defined as the process of listing essential activities in sequence with the time needed to complete each activity. It is a challenging job due to the wide variety of different needs and requirements that must be handled, either at professional or amateur level. Thus, this paper utilizes a combination of constraint-based methodology and a neighborhood search approach in order to solve a sport tournament scheduling problem in a student sports event among the residential colleges in University Utara Malaysia (UUM). The tournament is an annual campus event, which usually runs several weeks and involves several types of game. The objective of the proposed approach is to minimize the length of breaks or rest periods among different teams in a game so as the whole event runs well with balanced break distribution. Another implication of the proposed approach is that it is able to minimize management costs in term of the number of manpower used and maximize the usage length of a game venue. Some preliminary experiments done have shown that the scheduling efforts and times are significantly decreased when compared to the current manual approach. Thus, this approach is able to yield better performance and is more efficient than the current approach.