Nesting planning based on production priorities and technological efficiency

DOI10.1016/0377-2217(93)E0164-SzbMath0928.90026OpenAlexW2017131190MaRDI QIDQ1129962

Arie Dayagi, Oded Z. Maimon

Publication date: 16 August 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0164-s

zbMATH Keywords

nesting planparametric multiobjective mathematical programming

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Polygon nesting and robustness
• A typology of cutting and packing problems
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An approach to two-dimensional cutting stock problems
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A Solution of the Rectangular Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem

This page was built for publication: Nesting planning based on production priorities and technological efficiency