Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates

The problem of generating guillotine cutting patterns for a number of stock entities with a rectangular form is discussed. We present exact algorithms and heuristics for solving exactly and approximately the general two-dimensional guillotine cutting (with many stock entities) and a particular case...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering 1997, Vol.32 (1), p.187-205
Hauptverfasser:	Hifi, Mhand, Ouafi, Rachid
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Cutting stock problem Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Graph representations Heuristic Inventory control, production control. Distribution Knapsack problem Operational research and scientific management Operational research. Management science Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!