Set covering and set partitioning: A collection of test problems

It is now well established that set covering and set partitioning models play a central role in many scheduling applications. There are many algorithms which solve these problems. In order to test and validate implementations of such algorithms the authors have collected a range of test problems taken from different contexts. A brief description of these models, their applications and summary model data, are supplied in this paper.