You are here

Uttf instances

On this page, we provide the uttf instances used in the paper “Efficient Filtering for the Unary Resource with Family-based Transition Times that has been submitted at the CP2016 conference.

These instances represent Job-Shop problems with sequence-dependent family-based transition times.

Part of the instances have the same number of families on a given machine, some do not. They are in two separated folders. Moreover, sub-folders containing instances have the following name format: m-j-f, where m is the number for machines, j the number of jobs and f the number of families in the instances contained in the folder.

These instances are in the format of t2-ps ( of Neil Simonetti’s Traveling Salesman Problem Web Page ( and can be read as follows (explanations taken from Angelo Oddi’s Job Shop Scheduling with Setup Times and Time Windows Web Page ( :

  1. the first entry is the number of problems, always 1 for these files;
  2. the first entry of the second line is the number of jobs, call it j
  3. the next j lines indicate how many steps are in each job, in these cases each entry is the number of machines m;
  4. the next j x m lines indicate the individual steps for each job (four entries for each line):
    • machine number is first;
    • processing time second;
    • min separation time with the next activity, third (always 0 in these instances);
    • max separation time with the next activity, fourth (always 0 in these instances);
    • min and max separation times take the conventional value 0 for the last activity of each job and they are not used;
  5. the next (j x m + 1) squared entries are the set-up times.
jobshopwithfamilytransitions.zip12.53 MB