Optimization of a line-cutting procedure for ship hull construction by an effective tabu search

DOI10.1080/00207540600607242zbMath1154.90386OpenAlexW2072676880MaRDI QIDQ3605417

T. C. Sung, Wei-Chu Weng

Publication date: 24 February 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600607242

zbMATH Keywords

tabu searchaggregative replacement movebreaking replacement movedecrease moveincrease moveship hull constructionunbounded Knapsack problem

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• A combined approach to the solution to the general one-dimensional cutting stock problem
• Tabu Search—Part I
• Cutting optimization with variable-sized stock and inventory status data