Two-stage two-dimensional guillotine cutting stock problems with usable leftover
From MaRDI portal
Publication:2803258
DOI10.1111/itor.12077zbMath1338.90331OpenAlexW2171728005WikidataQ57719384 ScholiaQ57719384MaRDI QIDQ2803258
No author found.
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12077
bilevel programmingMIP modelsleftoversresidual bin-packing problemresidual cutting-stock problemtwo-stage two-dimensional guillotine cutting
Related Items (12)
A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Unnamed Item ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
Cites Work
- Unnamed Item
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Reducing the number of cuts in generating three-staged cutting patterns
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Cutting optimization of structural tubes to build agricultural light aircrafts
- One-dimensional cutting stock optimization in consecutive time periods
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach
- Near-optimal solutions to one-dimensional cutting stock problems
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- A sequential heuristic procedure for one-dimensional cutting
- The trim-loss and assortment problems: A survey
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Solution procedures for cutting lumber into furniture parts
- Optimization of roll cutting in clothing industry
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- The cutting stock problem in a hardboard industry: A case study.
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Efficient algorithms for real-life instances of the variable size bin packing problem
- A combined approach to the solution to the general one-dimensional cutting stock problem
- Two-dimensional packing problems: a survey
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- A new dynamic programming procedure for three-staged cutting patterns
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A heuristic for the one-dimensional cutting stock problem with usable leftover
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Two-dimensional Cutting Stock with Multiple Stock Sizes
- Integer linear programming for a cutting problem in the wood-processing industry: a case study
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A New Linear Programming Approach to the Cutting Stock Problem
- A note on handling residual lengths
- The One Dimensional Cutting Stock Problem Using Two Objectives
- Checkerboard pattern: proposals for its generation
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic
- Multistage Cutting Stock Problems of Two and More Dimensions
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: Two-stage two-dimensional guillotine cutting stock problems with usable leftover
