This work addresses the problem of cyclic cleaning scheduling in heat exchanger networks (HENs). A salient characteristic of this problem is that the performance of each heat exchanger decreases with time which can then be restored to its initial state by performing cleaning operations. Due to the cyclic nature of the schedule, some operations may span successive cycles (wrap-around) which should be taken into account in the mathematical models. A tight mixed integer linear programming (MILP) model is proposed minimising cleaning cost and energy requirements. A complex heat exchanger network example is presented to illustrate the applicability of the proposed model.