Solution approaches for the cutting stock problem with setup cost

DOI10.1016/j.cor.2012.06.007zbMath1349.90571OpenAlexW2157658483MaRDI QIDQ339571

Ali Ekici, Azadeh Mobasher

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.007

zbMATH Keywords

heuristicscolumn generationlocal searchcutting stock problemsetup cost

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (11)

Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed charge problems with identical fixed charges
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
• Setup minimising conditions in the trim loss problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• A typology of cutting and packing problems
• LP models for bin packing and cutting stock problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• One-dimensional cutting stock problem to minimize the number of different patterns
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Pattern minimisation in cutting stock problems
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• An improved typology of cutting and packing problems
• Optimization of Wafer Exposure Patterns Using a Two-Dimensional Cutting Algorithm
• Mathematical Methods of Organizing and Planning Production
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
• A branch-and-price-and-cut algorithm for the pattern minimization problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
• Pattern reduction in one-dimensional cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: Solution approaches for the cutting stock problem with setup cost