Selection and Design of Heuristic Procedures for Solving Roll Trim Problems

DOI10.1287/MNSC.34.12.1460MaRDI QIDQ3807861zbMATH OpenOpenAlexFDO

Authors Robert W. Haessler

Publication date 1988

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.34.12.1460

zbMATH Keywords

one-dimensional roll trim problemsselection and design of heuristic procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Production models (90B30) Linear programming (90C05) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• One-dimensional cutting stock problems and solution procedures
• Near-optimal solutions to one-dimensional cutting stock problems
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• A two-phase roll cutting problem
• The cutting stock problem

Cited in

(10)

• Bethlehem steel combines cutting stock and set covering to enhance customer service
• Knowledge based approach to the cutting stock problem
• Procedures for solving a 1-dimensional cutting problem
• The log bucking problem: A comparison of dynamic programming versus branch and bound
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
• Sequential design with applications to the trim-loss problem
• Progressive selection method for the coupled lot-sizing and cutting-stock problem
• Trim loss optimization by an improved differential evolution
• The combined cutting stock and lot-sizing problem in industrial processes

This page was built for publication: Selection and Design of Heuristic Procedures for Solving Roll Trim Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3807861)