A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects

This paper deals with a two-dimensional cutting problem in which small rectangular items of given types are to be cut from a rectangular large object which contains several defects. It is assumed that the number of pieces of each small item type which can be cut from the large object is not limited....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	OR Spectrum Jg. 36; H. 4; S. 971 - 999
Hauptverfasser:	Afsharian, Mohsen, Niknejad, Ali, Wäscher, Gerhard
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2014 Springer Nature B.V
Schlagworte:	Algorithms Business and Management Calculus of Variations and Optimal Control; Optimization Computation Cutting Cutting stock problem Defects Discretization Dynamic programming Dynamics Experiments Heuristic Mathematical models Operations research Operations Research/Decision Theory Optimization Regular Article Studies Two dimensional Europe Dynamic programming Two-dimensional cutting Computational complexity Defects
ISSN:	0171-6468, 1436-6304
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!