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

DOI10.1016/S0377-2217(02)00853-6zbMath1044.90029MaRDI QIDQ1428051

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

Publication date: 14 March 2004

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

zbMATH Keywords

HeuristicsInterval graphsSet coveringMaximum cliqueBipartite matchingCardboard production

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• An algorithm for set covering problem
• Topics in Intersection Graph Theory

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