The problem of selecting a random subset of good populations out of $k$ populations is considered. The populations $\Pi_1, \cdots, \Pi_k$ are characterized by the location parameters $\theta_1, \cdots, \theta_k$ and $\Pi_i$ is said to be a good population if $\theta_i > \max_{1 \leq j\leq k}\theta_j - \Delta$, and a bad population if $\theta_i \leq \max_{1 \leq j \leq k} \theta_j - \Delta$, where $\Delta$ is a specified positive constant. A theory for a special class of procedures, called Schur procedures, is developed, and applied to certain minimax problems. Subject to controlling the minimum expected number of good populations selected or the probability that the best population is in the selected subset, procedures are derived which minimize the expected number of bad populations selected or some similar criterion. For normal populations it is known that the classical "maximum-type" procedures has certain minimax properties. In this paper, two other procedures are shown to have several minimax properties. One is the "average-type" procedure. The other procedure has not previously been considered as a serious contender.