Summary: The rank of a semigroup, an important and relevant concept in Semigroup Theory, is the cardinality of a least-size generating set. Semigroups of transformations that preserve or reverse the order or the orientation as well as semigroups of transformations preserving an equivalence relation have been widely studied over the past decades by many authors. The purpose of this article is to compute the ranks of the monoid \(\mathcal{OR}_{m\times n}\) of all orientation-preserving or orientation-reversing full transformations on a chain with \(mn\) elements that preserve a uniform \(m\)-partition and of its submonoids \(\mathcal{OP}_{m\times n}\) of all orientation-preserving transformations and \(\mathcal{OD}_{m\times n}\) of all order-preserving or order-reversing full transformations. These three monoids are natural extensions of \(\mathcal O_{m\times n}\), the monoid of all order-preserving full transformations on a chain with \(mn\) elements that preserve a uniform \(m\)-partition. Given \(m,n\geq 2\), we show that the rank of \(\mathcal{OP}_{m\times n}\) is equal to \(2n+\lceil\tfrac{n-1}2\rceil+1\), for \(m>2\), and equal to \(n+\lceil\tfrac{n-1}2\rceil+1\), for \(m=2\), the rank of \(\mathcal{OD}_{m\times n}\) is equal to \(\lceil\tfrac{mn}2\rceil+\lceil\tfrac{(m-1)n}2\rceil+1\) and the rank of \(\mathcal{OR}_{m\times n}\) is equal to \(\lceil\tfrac n2\rceil+\lceil\tfrac{n-1}2\rceil+2\), for \(m>2\), and equal to \(\lceil\tfrac n2\rceil+\lceil\tfrac{n-1}2\rceil+2\), for \(m=2\). These results have quite nontrivial proofs and were intuited by performing massive calculations with GAP [The GAP Group (2008). GAP – Groups, Algorithms, and Programming, Version 4.4.12. http://www.gap-system.org], a system for computational discrete algebra. Moreover, in this article, we also determine the ranks of certain semigroups of orientation-preserving full transformations with restricted ranges.