Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

DOI10.1016/J.EJOR.2020.03.060zbMATH Open1443.90304OpenAlexW3015994777MaRDI QIDQ2184147FDOQ2184147

Authors: Danni Wang, Fan Xiao, Lei Zhou, Zhe Liang 

Publication date: 27 May 2020

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

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

Recommendations

• Solution approaches for the cutting stock problem with setup cost
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• Algorithms for the one-dimensional two-stage cutting stock problem
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost

zbMATH Keywords

productionsetup costcolumn-and-row generationdiving heuristicskiving and cutting stock problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• An improved typology of cutting and packing problems
• Multicriteria Optimization
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• 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
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• Labeling algorithms for multiple objective integer knapsack problems
• A typology of cutting and packing problems
• Pattern minimisation in cutting stock problems
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• One-dimensional cutting stock problem to minimize the number of different patterns
• The one-dimensional cutting stock problem with usable leftovers -- a survey
• C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
• Solution approaches for the cutting stock problem with setup cost
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
• Integer linear programming models for the skiving stock problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The skiving stock problem as a counterpart of the cutting stock problem
• The Theory and Computation of Knapsack Functions
• Setup minimising conditions in the trim loss problem
• Two-dimensional cutting stock problem with sequence dependent setup times
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• Shortest path algorithms for knapsack type problems
• Row and column generation technique for a multistage cutting stock problem
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
• A LP-based heuristic for a time-constrained routing problem
• The knapsack problem with a minimum filling constraint
• Classification and literature review of integrated lot-sizing and cutting stock problems
• Algorithms for the one-dimensional two-stage cutting stock problem
• Combined cutting stock and lot-sizing problem with pattern setup
• In situ column generation for a cutting-stock problem
• Nonlinear cutting stock problem model to minimize the number of different patterns and objects
• A combined matheuristic for the piecewise linear multicommodity network flow problem
• The skiving stock problem and its relation to hypergraph matchings
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• A new scalarization technique and new algorithms to generate Pareto fronts
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study

Cited In (7)

• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Solution approaches for the cutting stock problem with setup cost
• Title not available (Why is that?)
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

This page was built for publication: Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

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