Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
From MaRDI portal
Publication:2170201
DOI10.1007/978-3-031-08011-1_17zbMath1504.90129OpenAlexW4293203540MaRDI QIDQ2170201
J. Christopher Beck, Yiqing L. Luo
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_17
optimizationmixed integer linear programmingconstraint programmingcutting stock problemguillotine cuts
Uses Software
Cites Work
- Temporal linear relaxation in IBM ILOG CP optimizer
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Mixed integer programming models for job shop scheduling: A computational analysis
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- LP bounds in various constraint programming approaches for orthogonal packing
- Introducing global constraints in CHIP
- Two-dimensional packing problems: a survey
- Rescheduling railway traffic on real time situations using time-interval variables
- Exact solution techniques for two-dimensional cutting and packing
- CP and hybrid models for two-stage batching and scheduling
- A constraint programming approach to electric vehicle routing with time windows
- On the reification of global constraints
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Optimization Models for a Real-World Snow Plow Routing Problem
- Almost Square Packing
- Multistage Cutting Stock Problems of Two and More Dimensions
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
