We study tilings of rectangular and circular arrays with specified sets of colored rectangular tiles. In particular, we consider rectangular tiles of arbitrarily large size, but where the number of colors available to use on a particular tile is determined by its position on the array. While tiling enumeration is often used to prove identities involving Fibonacci and Lucas numbers, the tilings we examine yield natural connections with sets of permutations.