We study the family of skew polyominoes, an intermediate class between L-convex and 4-stack polyominoes, defined by geometrical constraints satisfied by pairs of rows/columns. The problem of enumerating this family according to the semi-perimeter (size) is open, and can lead to a simplified enumeration of Z-convex polyominoes. We define a recursive method for the exhaustive generation of these objects of given size, based on generating trees. In practice, we introduce a set of operations on skew polyominoes, which perform local expansions on the objects, and such that every skew polyomino of size n + 1 is uniquely generated from one of size n. This leads to a simple algorithm for the exhaustive generation of skew polyominoes of size n in constant amortized time.