The one-dimensional cutting stock problem with due dates
type: Item
instance of: scholarly article
title: The one-dimensional cutting stock problem with due dates
zbMATH Open document ID: 1176.90243
author: Harald Reinertsen
author: Thomas W. M. Vossen
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5634701
zbMATH Keywords: cutting
zbMATH Keywords: integer programming
zbMATH Keywords: scheduling
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.03.042
OpenAlex ID: W2092286257
cites work: One-dimensional cutting stock optimization in consecutive time periods
cites work: New integer programming formulations and an exact algorithm for the ordered cutting stock problem
cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
cites work: A typology of cutting and packing problems
cites work: Finding the k Shortest Paths
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A new model for complete solutions to one-dimensional cutting stock problems.
cites work: Multi-job Cutting Stock Problem with Due Dates and Release Dates
cites work: Order Allocation for Stock Cutting in the Paper Industry
cites work: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
cites work: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: A genetic algorithm solution for one-dimensional bundled stock cutting
cites work: An improved typology of cutting and packing problems
cites work: An integrated cutting stock and sequencing problem
DOI: 10.1016/J.EJOR.2009.03.042
description: scientific article; zbMATH DE number 5634701