This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling and in archaeological seriation. Three exact algorithms and two heuristic procedures are described and compared.