Test Sets - Overview
Test Sets for the Capacitated Lot-Sizing Problem with Linked Lot-Sizes (CLSPL)
used in: Christopher Suerie/Hartmut Stadtler (2003): The Capacitated Lot-Sizing Problem with Linked Lot-Sizes, Management Science, Vol. 49, No. 8, pp. 1039-1054.
Test Sets for Planning and Scheduling with Multiple Intermediate Due Dates
used in: Christopher Suerie (2005): Planning and Scheduling with Multiple Intermediate Due Dates - An Effective Discrete Time Model Formulation, Industrial & Engineering Chemistry Research, Vol. 44, No. 22, pp. 8314-8322.
Test Sets for Models with Period Overlapping Setup Times
used in: Christopher Suerie (2006): Modeling of period overlapping setup times, European Journal of Operational Research, Vol. 174, pp. 874-886.
Test Sets for the Multi-Level Capacitated Lot-Sizing Problem (MLCLSP)
used in: Hartmut Stadtler (2003): Multi-Level Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows, Operations Research, Vol. 51, No. 3, pp. 487-502.
Test Sets for the Capacitated Lot-Sizing Problem with Linked Lot-Sizes (CLSPL)
The test instances provided here serve as a basis for computational tests on lot-sizing problems of the CLSPL type without backlogging (Capacitated Lot-Sizing Problem with Linked Lot-Sizes).
The solutions made available via this website are not all proven to be optimal, because of the problem size and the solution approach used. However, they are the best solutions known to the author.
There are three data sets available, together with the best known objective function value and a lower bound.
1) The first data set – data – is the same used by Trigeiro et al. (1989) in Trigeiro, W.W., L.J. Thomas, J.O. McClain. 1989. Capacitated lotsizing with setup times, Management Science, 35, 353-366, but has a different data format than the original files available at ftp://ftp.eng.auburn.edu/pub/gaoyubo/clspst. Which test instance of Trigeiro et al. (1989) is converted into which test instance of the new format, is documented in the file conv_ttm_new.txt.
2) The second data set – datam – originates from the phase III problems of Trigeiro et al. (1989), but the data is aggregated according to the following procedure: For test instances with 10 items, items 1-4 and 5-8 are aggregated to form two new items, such that together with the unchanged items 9 and 10 this subset now has four items. For test instances with 20 items, items 1-8 and 9-16 are aggregated to form a new class with six items, whereas for test instances with 30 items, items 1-10, 11-20, 21-23 and 24-26 are aggregated, resulting in a total of eight items. The aggregation is defined such, that the sum of demands (setup costs, setup times) is taken as the demand (setup cost, setup time) of the new item, whereas the average is taken for production coefficients and holding cost coefficients. Which test instance of Trigeiro et al. (1989) serves as a basis for which test instance of the new format, is documented in the file conv_ttm_new_modified.txt.
3) The third data set – datab – contains 60 MLCLSP instances taken from class B+ of Stadtler, H. 2003. Multi-Level Lot-Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows, Operations Research, 51, 487-502, which can be found at Test Sets for the Multi-Level Capacitated Lot-Sizing Problem (MLCLSP))
|
Test set |
T |
J |
M |
Setup times |
Test data |
Solutions |
|
1 |
15-30 |
6-30 |
1 |
Yes |
||
|
2 |
20 |
4-8 |
1 |
Yes |
||
|
3 |
24 |
10 |
3 |
Yes |
Full download (590 KB): testdata
A comprehensive introduction to the data format of the test sets is available in PDF-format and PS-format.
Test Sets for Planning and Scheduling with Multiple Intermediate Due Dates
The test instances provided here serve as a basis for computational tests on production planning problems in chemical / process industries.
The solutions discussed in the paper (Christopher Suerie (2005): Planning and Scheduling with Multiple Intermediate Due Dates - An Effective Discrete Time Model Formulation,Industrial & Engineering Chemistry Research, Vol. 44, No. 22, pp. 8314-8322) are proven to be optimal.
There are two data sets available, the original data set and a modified one.
1)
The first data set has also been used by
- Karimi, I. A.; McDonald, C. M. Planning and Scheduling of Parallel Semicontinuous Processes. 2. Short-Term Scheduling. Ind. Eng. Chem. Res. 1997, 36, 2701-2714,
- Ierapetritou, M. G.; Hene, T. S.; Floudas, C. A. Effective Continuous-Time Formulation for Short-Term Scheduling. 3. Multiple Intermediate Due Dates. Ind. Eng. Chem. Res. 1999, 38, 3446-3461,
- Lee, K.-H.; Heo, S.-K.; Lee, H.-K.; Lee, I.-B. Scheduling of Single-Stage and Continuous Processes on Parallel Lines with Intermediate Due Dates. Ind. Eng. Chem. Res. 2002, 41, 58-66.
The data format is described in this file and the complete data set can be obtained here.
2) The second data set has only been used in this paper (so far). The data format is described in this file and the complete data set can be obtained here.
Test Sets for Models with Period Overlapping Setup Times
The data format is described in this file and the complete data set can be obtained here.
Test Sets for the Multi-Level Capacitated Lot-Sizing Problem (MLCLSP)
The data format is described in this file and the complete data set (including objective function values and lower bounds) can be obtained here.