Solving a combined cutting-stock and lot-sizing problem with a column generating procedure

Authors:
Sigrid Lise Nons;Anders Thorstenson
Affiliations:
Department of Finance and Management Science, Norwegian School of Economics and Business Administration, Helleveien 30, N-5045 Bergen, Norway;Logistics/SCM Research Group, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 2

Selection and design of heuristic procedures for solving roll trim problems

Management Science
A Dynamic Stochastic Stock-Cutting Problem

Operations Research
One-dimensional cutting stock problems and solution procedures

Mathematical and Computer Modelling: An International Journal
Checking local optimality in constrained quadratic programming is NP-hard

Operations Research Letters

A CAM system for one-dimensional stock cutting

Advances in Engineering Software
Risk-averse two-stage stochastic programs in furniture plants

OR Spectrum

Quantified Score

Hi-index	0.01

Visualization

Abstract

In NonAs and Thorstenson [A combined cutting stock and lot sizing problem. European Journal of Operational Research 120(2) (2000) 327-42] a combined cutting-stock and lot-sizing problem is outlined under static and deterministic conditions. In this paper we suggest a new column generating solution procedure for this problem that works well on both small and large-sized problems. The procedure includes characteristics from both the column generating procedure in NonAs and Thorstenson, which works well on small-sized problems, and from the sequential heuristic due to Haessler [A heuristic programming solution to a nonlinear cutting stock problem, Management Science 17(12) (1971) 793-802], which works well on large-sized problems. Numerical results are presented that show that the new heuristic performs better than both of the earlier procedures. Comparisons with results obtained by other authors indicate that the procedure works well also for the extended cutting-stock problem with only a setup cost for each pattern change.