Solving a large cutting problem in the glass manufacturing industry
From MaRDI portal
Publication:2189955
DOI10.1016/j.ejor.2020.05.016zbMath1443.90301OpenAlexW3026181585MaRDI QIDQ2189955
Francisco Parreño, M. T. Alonso, Ramón Alvarez-Valdés
Publication date: 17 June 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.05.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Cites Work
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- A beam search approach to the container loading problem
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- A beam search algorithm for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Determining cutting stock patterns when defects are present
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- The bounded beam search algorithm for the block relocation problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Matheuristics for the irregular bin packing problem with free rotations
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- Cutting rectangles avoiding rectangular defects
- An exact solution approach for scheduling cooperative gantry cranes
- 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
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Models and algorithms for three-stage two-dimensional bin packing
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
- Two-Dimensional Finite Bin-Packing Algorithms
- 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: Solving a large cutting problem in the glass manufacturing industry
