A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem

DOI10.1287/IJOC.4.3.351MaRDI QIDQ4030932zbMATH OpenOpenAlexFDO

Authors Parviz Ghandforoush, John J. Daniels

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.4.3.351

zbMATH Keywords

heuristic algorithmguillotine constrained cutting stock

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
• An algorithm for the 2D guillotine cutting stock problem
• An algorithm for a cutting stock problem on a strip
• A recursive algorithm for constrained two-dimensional cutting problems
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM

Cited in

(8)

• An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• scientific article; zbMATH DE number 1094768 (Why is no real title available?)
• scientific article; zbMATH DE number 710068 (Why is no real title available?)
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• Solution for the constrained Guillotine cutting problem by simulated annealing
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Heuristic and exact methods for the cutting sequencing problem

This page was built for publication: A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem

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