The one-dimensional cutting stock problem with due dates

DOI10.1016/j.ejor.2009.03.042zbMath1176.90243MaRDI QIDQ1038325

Harald Reinertsen, Thomas W. M. Vossen

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

zbMATH Keywords

integer programming; scheduling; cutting

Mathematics Subject Classification ID

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

Related Items

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, Reducing the number of cuts in generating three-staged cutting patterns, Two-dimensional cutting stock problem with sequence dependent setup times, Enumerating \(K\) best paths in length order in DAGs

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