The One Dimensional Cutting Stock Problem Using Two Objectives

DOI10.1057/jors.1994.28zbMath0789.90062OpenAlexW1993905290MaRDI QIDQ4282749

Zilla Sinuany-Stern, Ittai Weiner

Publication date: 10 April 1994

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

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

zbMATH Keywords

heuristic approachcutting stocktwo objectives

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Combinatorial optimization (90C27)

Related Items (10)

One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ An exact algorithm for large multiple knapsack problems ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants ⋮ The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic ⋮ Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey

This page was built for publication: The One Dimensional Cutting Stock Problem Using Two Objectives