This page contains the instances that accompany the manuscript

Song, G., Kowalczyk, D. and Leus, R. (2018).  The robust machine availability problem - bin packing under uncertainty.  IISE Transactions, 50(11), 997-1012.  (pdf) (DOI)

The instances are gathered in one zip-archive, to be downloaded here.

The data are formatted as follows:

• In each data file, the first is the value n which is the number of jobs, the remaining values are the processing times;

• The number of jobs n is either 30, 60, 90, 120, 150 and 180;

• The processing times are integers uniformly drawn from interval [1, 20] or [1, 100];

• The processing-time deviation is 0.2 times the processing time, rounded to the nearest higher integer;

• Five robustness levels are considered, either 0%, 5%, 10%, 15% or 20% of n as value for Gamma;

• Four deadlines are generated for each instance, which are equal to a fraction of the sum of the worst-case job processing times; the fractions considered are 1/4, 1/6,1/8 and 1/10;

• Additional ranges [1, 200] and [1, 500] are tested for n=150, instances are included in the folder "Large150".