| Article ID: | iaor1988220 |
| Country: | France |
| Volume: | 21 |
| Issue: | 1 |
| Start Page Number: | 65 |
| End Page Number: | 85 |
| Publication Date: | Feb 1987 |
| Journal: | RAIRO Operations Research |
| Authors: | Laporte Gilbert |
| Keywords: | scheduling |
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.