Alternative configurations for cutting machines in a tube cutting mill

DOI10.1016/J.EJOR.2005.12.049MaRDI QIDQ2643969zbMATH OpenOpenAlexFDO

Authors Iman Hajizadeh, Chi-Guhn Lee

Publication date 27 August 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.12.049

zbMATH Keywords

continuous stock cutting problemcutting stock problem with setup

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Recommendations

• A cutting stock problem with alternatives: the tubes rolling process
• On the one-dimensional stock cutting problem in the paper tube industry
• Solution approaches for the cutting stock problem with setup cost
• Cutting aluminium coils with high length variabilities
• One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model

Cites work

• scientific article; zbMATH DE number 3999654 (Why is no real title available?)
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A mixed integer programming model for solving a layout problem in the fashion industry
• A new model for complete solutions to one-dimensional cutting stock problems.
• A sequential heuristic procedure for one-dimensional cutting
• A typology of cutting and packing problems
• Alternative formulations for a layout problem in the fashion industry
• An algorithm for the determination of optimal cutting patterns
• An improved typology of cutting and packing problems
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Different transformations for solving non-convex trim-loss problems by MINLP
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• One-dimensional cutting stock problem to minimize the number of different patterns
• Optimal solutions for the cutting stock problem
• Random search in the one-dimensional cutting stock problem
• Setup minimising conditions in the trim loss problem
• The dissection of rectangles into squares

Cited in

(2)

• A note on ``Reducing the number of binary variables in cutting stock problems
• Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems

This page was built for publication: Alternative configurations for cutting machines in a tube cutting mill

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