This page contains the instances and results that accompany the manuscript

Song G., Kis T. and Leus R. (2021).  Polyhedral results and branch-and-cut for the resource loading problem.  INFORMS Journal on Computing, 33(1), 105-119.  (pdf) (DOI)

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

The instances are grouped in three folders: (1) with the unit tardiness cost for each order set as a fixed value 5, (2) with the unit tardiness cost drawn from uniform distribution U(1,10), and (3) the instances with precedence constraints.

Each instance is formatted as follows:

• the first value is the number of orders n, the second is the number of periods in the planning horizon H, the third value is the unit cost of non-regular capacity;

• the following H values are the regular capacity of each period;

• the next n rows contain the data for each order: the release date, the due date, the work content, the shortest execution-interval length, the longest execution-interval length, and the unit cost for tardiness;

• for the instances with precedence constraints there are n extra rows; each row starts with the number of successors of the corresponding order, followed by the list of successors.

For the computational results: each row in one file is for one particular instance, and we report the run time, instance solved (value 2) or not (value 1), the gap between the upper and lower bound, the optimal (incumbent) solution, and the number of nodes explored in the branch-and-bound tree.  Additionally, for the branch-and-cut algorithm, we have two more entries: the maximum depth of the branch-and-bound tree, and the number of cuts seperated.