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

DOI10.1016/J.EJOR.2020.03.060MaRDI QIDQ2184147zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

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

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)