Please use this identifier to cite or link to this item:

TitleExact solution of combined cutting stock and scheduling problems
Author(s)Braga, Nuno
Alves, Cláudio
Valério de Carvalho, José Manuel
Issue date2016
PublisherSpringer International Publishing
JournalLecture Notes in Economics and Mathematical Systems
Abstract(s)[Extrato] Given their practical relevance and their challenging nature, cutting and packing problems have been a major topic of research since many years. The typology of Wäscher et al. [7] is a good illustration of this fact. Apart from providing a wide classification scheme for these problems, it also identifies a large set of contributions for different variants of the standard problem. These variants cover different characteristics of the items and rolls and different kinds of objective functions, for example. In this paper, we address one possible variant of the problem that considers a scheduling term in the objective function related to the existence of due dates imposed on the delivery of the items. This problem has been addressed recently by Reinertsen and Vossen in [6] and Arbib and Marinelli in [1].
TypeBook part
Publisher version
AccessRestricted access (Author)
Appears in Collections:CAlg - Livros e capítulos de livros/Books and book chapters

Files in This Item:
File Description SizeFormat 
Exact solution of combined cssp.pdf
  Restricted access
155,87 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID