The one-dimensional cutting stock problem with due dates
From MaRDI portal
Recommendations
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- One-dimensional cutting stock optimization in consecutive time periods
- Two-Stage Cutting Stock Problem with Due Dates
- One-dimensional cutting stock problems and solution procedures
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Cites work
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A genetic algorithm solution for one-dimensional bundled stock cutting
- A new model for complete solutions to one-dimensional cutting stock problems.
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- A typology of cutting and packing problems
- An improved typology of cutting and packing problems
- An integrated cutting stock and sequencing problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Finding the k Shortest Paths
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- LP models for bin packing and cutting stock problems
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- One-dimensional cutting stock optimization in consecutive time periods
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Order Allocation for Stock Cutting in the Paper Industry
- 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
Cited in
(21)- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Heuristic algorithms based on column generation for an online product shipping problem
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- Combined cutting stock and lot-sizing problem with pattern setup
- Two-dimensional cutting stock problem with sequence dependent setup times
- A hybrid algorithm for constrained order packing
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Classification and literature review of integrated lot-sizing and cutting stock problems
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- A reinforcement learning approach to the stochastic cutting stock problem
- Enumerating \(K\) best paths in length order in DAGs
- One-dimensional cutting stock optimization in consecutive time periods
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Reducing the number of cuts in generating three-staged cutting patterns
- Two-Stage Cutting Stock Problem with Due Dates
This page was built for publication: The one-dimensional cutting stock problem with due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038325)