Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem

DOI10.1007/978-3-031-08011-1_17zbMATH Open1504.90129OpenAlexW4293203540MaRDI QIDQ2170201FDOQ2170201

Authors: Yiqing L. Luo, J. Christopher Beck 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_17

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

zbMATH Keywords

optimizationconstraint programmingmixed integer linear programmingcutting stock problemguillotine cuts

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Solving a cutting-stock problem with the constraint logic programming language CHIP
• An improved typology of cutting and packing problems
• Introducing global constraints in CHIP
• On the reification of global constraints
• Multistage Cutting Stock Problems of Two and More Dimensions
• Two-dimensional packing problems: a survey
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Temporal linear relaxation in IBM ILOG CP optimizer
• Principles and Practice of Constraint Programming – CP 2004
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• 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
• A new constraint programming approach for the orthogonal packing problem
• Rescheduling railway traffic on real time situations using time-interval variables
• LP bounds in various constraint programming approaches for orthogonal packing
• Exact solution techniques for two-dimensional cutting and packing
• Optimization Models for a Real-World Snow Plow Routing Problem
• CP and hybrid models for two-stage batching and scheduling
• A constraint programming approach to electric vehicle routing with time windows
• Almost square packing

Cited In (2)

• Title not available (Why is that?)
• The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem

Uses Software

• CHIP
• ILOG SCHEDULE
• GitHub
• CP Optimizer

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)