On the best number of different standard lengths to stock for one-dimensional assortment problems

Abstract This paper considers the one-dimensional assortment problem (1D-AP) which includes the determination of the number of different sizes of standard lengths to be maintained as inventory and to be used to fulfill a set of cutting orders. Keeping two or more types of stock lengths in inventory is generally a better practice with respect to the total material cost, when compared to a single type of stock lengths. However, a greater variety in the number of different stock lengths results in increased complexity of operation, stocking and handling. The purpose of this paper is therefore to evaluate the possible savings in the total material cost which can be realized by using an assortment with two or more types of stock lengths, compared to an assortment with a single type of stock lengths. By investigating a large number of problem instances of different classes of the 1D-AP, it is shown that there exist problem classes for which it is possible to realize substantial savings in the total material cost by using an assortment with two, three or four types of standard lengths. However, the results of the computational study also reveal that there are other problem classes for which it is not possible to realize savings of more than 0.5%, even when an assortment with five or more different stock sizes can be used.

[1]  Oliver Holthaus,et al.  Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths , 2002, Eur. J. Oper. Res..

[2]  Gerhard Wäscher,et al.  Cutting and packing , 1995, Eur. J. Oper. Res..

[3]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[4]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[5]  David W. Pentico,et al.  The Assortment Problem with Nonlinear Cost Functions , 1976, Oper. Res..

[6]  David L. Woodruff,et al.  Selection of an optimal subset of sizes , 1999 .

[7]  Wieslaw Sadowski,et al.  A Few Remarks on the Assortment Problem , 1959 .

[8]  M. L. Chambers,et al.  The Cutting Stock Problem in the Flat Glass Industry - Selection of Stock Sizes , 1976 .

[9]  Harald Dyckhoff,et al.  Trim loss and related problems , 1985 .

[10]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[11]  J. Beasley An algorithm for the two-dimensional assortment problem , 1985 .

[12]  E. Page,et al.  A Note on a Two-dimensional Dynamic Programming Problem , 1975 .

[13]  Meng Dong-mei,et al.  Cutting and Packing Problems , 2002 .

[14]  Douglas D. Gemmill,et al.  A comparison of solution methods for the assortment problem , 1991 .

[15]  M. L. Wolfson Selecting the Best Lengths to Stock , 1965 .

[16]  A. I. Hinxman The trim-loss and assortment problems: A survey , 1980 .

[17]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[18]  Barrie M. Baker A spreadsheet modelling approach to the assortment problem , 1999, Eur. J. Oper. Res..

[19]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[20]  Douglas D. Gemmill Solution to the assortment problem via the genetic algorithm , 1992 .