The usable leftover one-dimensional cutting stock problem–a priority-in-use heuristic

The usable leftover one-dimensional cutting stock problem–a priority-in-use heuristic

0.00 Avg rating0 Votes
Article ID: iaor201524315
Volume: 20
Issue: 2
Start Page Number: 189
End Page Number: 199
Publication Date: Mar 2013
Journal: International Transactions in Operational Research
Authors: , ,
Keywords: heuristics
Abstract:

We consider a one‐dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock for a long time, hence, such leftovers have priority‐in‐use compared to standard objects (objects bought by the industry) in stock. A heuristic procedure is proposed for this problem, and its performance is analyzed by solving randomly generated dynamic instances where successive problems are solved in a time horizon. For each period, new demands arise and a new problem is solved on the basis of the information about the stock of the previous periods (remaining standard objects in the stock) and usable leftovers generated during those previous periods. The computational experiments show that the solutions presented by the proposed heuristic are better than the solutions obtained by other heuristics from the literature.

Reviews

Required fields are marked *. Your email address will not be published.