The composition of semi-finished inventories at a solid board plant.

DOI10.1016/S0377-2217(02)00853-6MaRDI QIDQ1428051zbMATH OpenFDO

Authors Henrico L. T. Wanders, Gerard J. C. Gaalman, Gerard Sierksma

Publication date 14 March 2004

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(02)00853-6

zbMATH Keywords

Bipartite matchingCardboard productionHeuristicsInterval graphsMaximum cliqueSet covering

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Roll assortment optimization in a paper mill: an integer programming approach
• A dynamic stochastic stock-cutting problem
• A two-dimensional strip cutting problem with sequencing constraint
• Reel and sheet cutting at a paper mill
• Optimising the cutting of wood fibre plates in the hardboard industry

Cites work

• An algorithm for set covering problem
• An exact algorithm for the maximum clique problem
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4156493 (Why is no real title available?)
• scientific article; zbMATH DE number 3679885 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Topics in Intersection Graph Theory

Cited in

(1)

• Make to stock and mix to order: choosing intermediate products in the food-processing industry

This page was built for publication: The composition of semi-finished inventories at a solid board plant.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428051)