[BPPGP] Instances
In order to perform computational experiments on the BPP-GP we extended the instances proposed by Otto, Otto, and Scholl (2013) originally developed for the Simple Assembly Line Balancing Problem (SALBP) by adding weights to the arcs. The base set contains 525 instances for each size n ∈ {20, 50, 100, 1000}. Two BPP-GP datasets were generated: (i) one with precedences taking value either 0 or 1; and (ii) other with precedences taking non-negative integer values ∈ {0, 1, 2, 3}. In total 4200 instances were generated (2100 for each dataset), and the original characteristics of the instances were kept (i.e., graph structure, order strenght, and distribution of task times). In addition to these, 1575 new instances have been generated for n ∈ {250, 500, 750}.
The instances proposed by Otto, Otto, and Scholl (2013) are available here. These instances can be used both for the SALBP-I and for the Bin Packing Problem with precedence constraints (BPP-P) by considering arc weiths equal to zero, or equal to one, respectivelly. Note that task time is equivalent to item weight, and cycle time is equivalent to bin capacity in the BPP notation.
To download the BPP-GP instances click here.
Cited reference:
Otto, A., Otto, C., Scholl, A. 2013. “Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing.” European Journal of Operational Research 228 (1): 33-45 (Available at http://dx.doi.org/10.1016/j.ejor.2012.12.029).