Single Batching Machine Problem Instances From As/Rs

The following instances are originally presented in the working paper "Logic-based Benders decomposition for scheduling a batching machine" written by Emde, Simon, Polten, Lukas, and Gendreau, Michel. The data corrospond to 108 instances each in its own file. Each file is structured as follows: The first line contains: the number of jobs, the number of batches and the maximum batch size Then there follows a line for each job containing first the processing time and then the deadline. Then a line with the number of the following precedence constraints. Then the lines for each precedence constraints, where the first job has to precede the second job. Note that the job are numbered starting from 0. Then a line with the number of incompatibilites. Then the lines for each incompatibility, containing two numbers, corresponding to a pair of jobs, that cannot be packed into the same batch. All numbers in the same line are seperated by spaces and all numbers are integers.