Two general purpose integer programming algorithms, one a fractional cutting-plane algorithm and the other a branch-and-bound algorithm, were investigated. The cutting-plane algorithm easily solves an important class of integer problems, a class of scheduling problems for the assigning of personnel to work shifts over a fixed period of time. Scheduling problems were constructed with 14 to 189 integer variables and with 14 to 21 constraints. The general branch-and-bound search was not effective on this class of scheduling problems, but it was effective on the classical test problems found in the literature of integer programming, many of which were not handled by the cutting-plane algorithm.