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

International Journal of Production Economics

Volumn 83, Issue 3, 2003, Pages 233-246

  Holthaus, Oliver ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Assortment problem; Cost minimization; Cutting stock problem; Stock size selection

Indexed keywords

COSTS; OPTIMIZATION; PROBLEM SOLVING;

ASSORTMENT PROBLEMS;

INVENTORY CONTROL;

EID: 0037432488     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(02)00375-4     Document Type: Article

References (18)

1. Baker B.M. A spreadsheet modelling approach to the assortment problem. European Journal of Operational Research. 114:1999;83-92.
2. Beasley J.E. An algorithm for the two-dimensional assortment problem. European Journal of Operational Research. 19:1985;253-261.
3. Chambers M.L., Dyson R.G. The cutting stock problem in the flat glass industry - selection of stock sizes. Operational Research Quarterly. 27:1976;949-957.
4. Dyckhoff H., Finke U. Cutting and Packing in Production and Distribution. 1992;Physica Verlag, Heidelberg, Germany.
5. Dyckhoff H., Kruse H.-J., Abel D., Gal T. Trim loss and related problems. Omega The International Journal of Management Science. 13:1985;59-72.
6. Dyckhoff H., Scheithauer G., Terno J. Cutting and packing. Dell'Amico M., Maffioli F., Martello S. Annotated Bibliographies in Combinatorial Optimization. 1997;393-412 Wiley, Chichester.
7. Gemmill D.D. Solution to the assortment problem via the genetic algorithm. Mathematical and Computer Modelling. 16:1992;89-94.
8. Gemmill D.D., Sanders J.L. A comparison of solution methods for the assortment problem. International Journal of Production Research. 29:1991;2521-2527.
9. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research. 9:1961;849-859.
10. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem - Part II. Operations Research. 11:1963;863-888.
11. Hinxman A.I. The trim-loss and assortment problems. a survey European Journal of Operational Research. 5:1980;8-18.
12. Holthaus O. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. European Journal of Operational Research, Special Issue on Cutting and Packing. 141:2002;295-312.
13. Jorjani S., Scott C.H., Woodruff D.L. Selection of an optimal subset of sizes. International Journal of Production Research. 37:1999;3697-3710.
14. Page E. A note on a two-dimensional dynamic programming problem. Operational Research Quarterly. 26:1975;321-324.
15. Pentico D.W. The assortment problem with nonlinear cost functions. Operations Research. 24:1976;1129-1142.
16. Sadowski W. A few remarks on the assortment problem. Management Science. 6:1959;13-24.
17. Sweeney P.E., Paternoster E.R. Cutting and packing problems. a categorized, application-orientated research bibliography Journal of the Operational Research Society. 43:1992;691-706.
18. Wolfson M.L. Selecting the best lengths to stock. Operations Research. 13:1965;570-585.