Problem Instances

Minimization of Open Stacks Problem (MOSP) or Minimization of Open Orders Problem (MOOP)

A set of 150 MOSP instances, randomly generated using the same generator proposed by Chu & Stuckey (2009).

None of these instances have MOSP graph topology that leads to polynomial time solution (i.e, complete graphs, trees or 1-trees).

The dimensions are 150 x 150, 175 x 175 and 200 x 200. For each dimension, 10 instances with 2, 4, 6, 8 and 10 customers (or pieces) per product (or pattern) were generated, summing 50 instances.

 

File Format

The first line contains a string (the name of the file)

The second line contains two integers: n - the number of customers (or pieces) and m - the number of products (or patterns).

In the following lines, a binary matrix n x m is described.

 

How to cite:

Carvalho, M. A. M, Soma, N. Y. (2015). A Breadth-First Search Applied to the Minimization of Open Stacks. Journal of the Operational Research Society,  66, 936–946, doi:10.1057/jors.2014.60.

 

Download

Click here to download.