It all depends on what one is willing to accept as a "tile". Bounded measurable set is out of question (if we use translations only, which the OP requested), so we have to drop either boundedness, or measurability. I leave playing with Hamel Basis to somebody else and just construct a countable union of intervals of infinite measure (so periodic tiling is certainly out of question). This is, of course, a too easy way to cheat, but one has to start somewhere :-)
Just start with an interval and place it somewhere. Now suppose we have congruent (by translation) tiles $T_1,\dots, T_n$ consisting of finitely many intervals placed already and have some hole (also an interval) we want to cover. Split this hole into $N$ small intervals of equal length so that their length is much less than the shifts between the already placed tiles. Now add to each tile $N$ intervals of the same length far away on the right and very far from each other in the positions to be chosen later. The tiles still won't overlap if "far" is far enough. Now use shifts of one tile to the left to cover the hole with different added intervals: just add them inductively left to right, so that when using each one, you'll move the rest of the tile (including the previously added intervals) far to the left where it cannot interfere with anything. You'll end up with more tiles consisting of more (but still finitely many intervals) and a filled hole. Then take the next hole you want to fill, and so on.
So, let's assume that we do not want a too easy way out and request that the measure of each tile is finite for the next attempt. Anyone up to the challenge?