Single Batching Machine Problem Instances from AS/RS

<p>The following instances are originally presented in the working paper &quot;Logic-based Benders decomposition for scheduling a batching machine&quot; written by Emde, Simon, Polten, Lukas, and Gendreau, Michel.</p> <p>The data corrospond to 540 instances each in its own file. Each file is structured as follows:</p> <p>The first line contains: the number of jobs, the number of batches and the maximum batch size</p> <p>Then there follows a line for each job containing first the processing time and then the deadline.</p> <p>Then a line with the number of the following precedence constraints.</p> <p>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.</p> <p>Then a line with the number of incompatibilites.</p> <p>Then the lines for each incompatibility, containing two numbers, corresponding to a pair of jobs, that cannot be packed into the same batch.</p> <p>All numbers in the same line are seperated by spaces and all numbers are integers.</p> <p>&nbsp;</p>