We study the multi-item economic lot scheduling problem (ELSP) with two sources of production: manufacturing and remanufacturing. Tang and Teunter (2006) rstly studied this problem (named ELSPR) presenting an algorithm for this problem that determines the optimal solution within the class of policies with a common cycle time and a single (re)manufacturing lot for each item in each cycle. Relaxing these constraints we propose a simple heuristic easy implementable based on Segerstedt (1999): numerical study shows applicability of the heuristic and the savings that can be obtained.