A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

In this paper we present a heuristic method to generate constrained two-dimensional guillotine cutting patterns. This problem appears in different industrial processes of cutting rectangular plates to produce ordered items, such as in the glass, furniture and circuit board business. The method uses...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 179; číslo 1; s. 297 - 315
Hlavní autoři:	Morabito, Reinaldo, Pureza, Vitória
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.09.2010 Springer Springer Nature B.V
Témata:	Algorithms Ascent Business and Management Circuit printing Combinatorics Constraints Cutting Cutting stock problem Dynamic programming Heuristic Heuristic methods Methods Operations research Operations Research/Decision Theory Optimization Packing problem Performance evaluation Printed circuits Searching Studies Theory of Computation Two dimensional Constrained two-dimensional guillotine cutting patterns Heuristics Dynamic programming And/or-graph search Cutting and packing problems
ISSN:	0254-5330, 1572-9338
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!