A search strategy for the one-size assortment problem

The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values wit...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1994-04, Vol.74 (1), p.135-142
Main Author: Yanasse, Horacio Hideki
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Assortment problem
Cutting stock problem
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Strategy
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)90211-9