Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
From MaRDI portal
Publication:2170201
Recommendations
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Cutting stock problems and solution procedures
- Tighter relaxations for the cutting stock problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Cites work
- A constraint programming approach to electric vehicle routing with time windows
- A new constraint programming approach for the orthogonal packing problem
- Almost square packing
- An improved typology of cutting and packing problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- CP and hybrid models for two-stage batching and scheduling
- Exact solution techniques for two-dimensional cutting and packing
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Introducing global constraints in CHIP
- LP bounds in various constraint programming approaches for orthogonal packing
- Mixed integer programming models for job shop scheduling: A computational analysis
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Multistage Cutting Stock Problems of Two and More Dimensions
- On the reification of global constraints
- Optimization models for a real-world snow plow routing problem
- Principles and Practice of Constraint Programming – CP 2004
- Rescheduling railway traffic on real time situations using time-interval variables
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Temporal linear relaxation in IBM ILOG CP optimizer
- Two-dimensional packing problems: a survey
Cited in
(6)- Models for two-dimensional bin packing problems with customer order spread
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
- scientific article; zbMATH DE number 5494075 (Why is no real title available?)
This page was built for publication: Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170201)
