You are here

Benchmarks for The Unary Resource with Transition Times

On this page, we provide the instances used in the paper “The Unary Resource with Transition Times” that has been submitted at the CP2015 conference.

These instances represent Job-Shop problems generated from existing Taillard instances (…) to which have been added transition times.

These instances are in the format of t2-ps and t2-pss instances ( 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.