The one-dimensional cutting stock problem with due dates
From MaRDI portal
Publication:1038325
DOI10.1016/J.EJOR.2009.03.042zbMath1176.90243OpenAlexW2092286257MaRDI QIDQ1038325
Thomas W. M. Vossen, Harald Reinertsen
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.042
Related Items (19)
Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ A hybrid algorithm for constrained order packing ⋮ Combined cutting stock and lot-sizing problem with pattern setup ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A reinforcement learning approach to the stochastic cutting stock problem ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods ⋮ A sequential value correction heuristic for a bi-objective two-dimensional bin-packing ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Cites Work
- One-dimensional cutting stock optimization in consecutive time periods
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving binary cutting stock problems by column generation and branch- and-bound
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- A new model for complete solutions to one-dimensional cutting stock problems.
- A typology of cutting and packing problems
- A genetic algorithm solution for one-dimensional bundled stock cutting
- LP models for bin packing and cutting stock problems
- 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
- An integrated cutting stock and sequencing problem
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- A Linear Programming Approach to the Cutting-Stock Problem
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- Order Allocation for Stock Cutting in the Paper Industry
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Finding the k Shortest Paths
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: The one-dimensional cutting stock problem with due dates
