The purpose of this paper is to create the single round robin tournament schedules for 19 teams that satisfy venues availability and various timing restrictions. To this end, a constraint programming approach is employed as the methodology to solve the problem. The proposed schedule is reasonably fair to each team, thus games between team and team are assigned at three venues on specific time with evenly spaced throughout the season. By introducing a tri-consecutive game model, the schedule for individual teams is concentrated; the delay of games is therefore reduced significantly which is a valuable property when real sports leagues are considered. Results imply that after several virtual teams are added to the scheduling process to meet all the requirements, the constraint programming approach achieves feasible solution efficiently for the sports scheduling problem.