This inspection problem generalizes several administrative permutation problems. It is the search for noncyclic solutions to a lattice ofJrows andMcolumns. Many time table problems have this lattice structure. For given permutations of row vectors the problem is known as job-scheduling. For a particular column it is a travelling salesman problem. Some properties of the inspection problem are stated and a model is given for the static version. In the dynamic model inspection times and change-over times are taken into account.