Solution approaches for the cutting stock problem with setup cost

In this paper, we study the Cutting Stock Problem with Setup Cost (CSP-S) which is a more general case of the well-known Cutting Stock Problem (CSP). In the classical CSP, one wants to minimize the number of stock items used while satisfying the demand for smaller-sized items. However, the number of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2013-01, Vol.40 (1), p.225-235
Hauptverfasser:	Mobasher, Azadeh, Ekici, Ali
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Column generation Cost engineering Cutting Cutting stock problem Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristics Industrial engineering Integer programming Local search Mathematical programming Mixed integer Operational research and scientific management Operational research. Management science Operations research Production costs Production planning Raw materials Setup cost Studies Tradeoffs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!