In this paper, we propose an integer linear programming model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how it can be used to define iterative algorithm that, period n, finds all which tile A and also efficiently check necessity of Coven-Meyerowitz condition (T2). To conclude, run several experiments validate time efficiency model.