An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case

DOI10.1007/978-3-319-89920-6_25zbMath1397.90166OpenAlexW2804506365MaRDI QIDQ4685755

Guntram Scheithauer, John Martinovic

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_25

zbMATH Keywords

cutting and packingskiving stock problemdivisible casegap best fit decreasing

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Cites Work

• Integer linear programming models for the skiving stock problem
• The proper relaxation and the proper gap of the skiving stock problem
• Integer rounding and modified integer rounding for the skiving stock problem
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• On a dual version of the one-dimensional bin packing problem
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The skiving stock problem as a counterpart of the cutting stock problem
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries

This page was built for publication: An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case