MULTILSB: Multi-item lot-sizing with backlogging

Dataset

Description

There are a total of 4 test sets, each containing 30 instances. Some data and BOM structure is based on the test problems described by Simpson and Erenguc (2005), although the problem structure is changed and all the data is newly generated. For detailed information, please see the documentation provided in the .zip file. For instructions on how to use these instances, please see the readme file provided. LP relaxation bounds and heuristic solutions of the problems are also provided in the .zip file.

We used these instances for extensive computational tests; please see the first two papers listed below for details.

Three of our hardest instances (namely set3-10, set3-15 and set3-20) were also selected for MIPLIB 2010 (see http://miplib.zib.de/).

- Akartunali, K. and A.J. Miller, "A Heuristic Approach for Big Bucket Multi-Level Production Planning Problems", European Journal of Operational Research, 193: 396-411, 2009.
- Akartunali, K. and A.J. Miller, "A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems", Computational Optimization and Applications, 53(3):729-753, 2012
- Simpson, N.C. and S.S. Erenguc, "Modeling Multiple Stage Manufacturing Systems with Generalized Costs and Capacity Issues", Naval Research Logistics, 52: 560–570, 2005.
Date made available2015
PublisherUniversity of Strathclyde

Cite this

Akartunali, K. (Creator), Miller, A. J. (Creator). (2015). MULTILSB: Multi-item lot-sizing with backlogging. University of Strathclyde. multilsbnew(.zip), readme(.txt). 10.15129/252b7827-b62b-4af4-8869-64b12b1c69a1