Solving a large cutting problem in the glass manufacturing industry
From MaRDI portal
Publication:2189955
Recommendations
- Evolutionary Computation in Combinatorial Optimization
- An optimization model for trim loss minimization in an automotive glass plant
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- A cutting and scheduling problem in float glass manufacturing
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
Cites work
- A beam search algorithm for the circular packing problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A beam search approach to the container loading problem
- A beam search implementation for the irregular shape packing problem
- 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
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- An exact solution approach for scheduling cooperative gantry cranes
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Cutting rectangles avoiding rectangular defects
- Determining cutting stock patterns when defects are present
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Exact solution of the two-dimensional finite bin packing problem
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Job shop scheduling with beam search
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Matheuristics for the irregular bin packing problem with free rotations
- Models and algorithms for three-stage two-dimensional bin packing
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Multistage Cutting Stock Problems of Two and More Dimensions
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- The bounded beam search algorithm for the block relocation problem
- Two-Dimensional Finite Bin-Packing Algorithms
Cited in
(12)- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- 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
- An optimization model for trim loss minimization in an automotive glass plant
- A beam search algorithm for minimizing crane times in premarshalling problems
- A cutting and scheduling problem in float glass manufacturing
- Evolutionary Computation in Combinatorial Optimization
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
This page was built for publication: Solving a large cutting problem in the glass manufacturing industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189955)
