A matching approach for replenishing rectangular stock sizes

DOI10.1057/PALGRAVE.JORS.2600910MaRDI QIDQ3156528zbMATH OpenOpenAlexFDO

Authors Francis J. Vasko, John A. McNamara, R. N. Parkes, Floyd E. Wolf, R. L. Woodyatt

Publication date 10 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600910

zbMATH Keywords

cutting stockgraph matchingheuristicspractice of OR

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 764408
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study
• Cutting stock problems and solution procedures
• Lp-Based Method For The Multi-Sheet Cutting Stock Problem
• An algorithm for a cutting stock problem on a strip

This page was built for publication: A matching approach for replenishing rectangular stock sizes

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