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

TitleCombined cutting stock and scheduling: a matheuristic approach
Author(s)Braga, Nuno
Alves, Cláudio
Macedo, Rita Alexandra Santos Gonçalves
Valério de Carvalho, José Manuel
KeywordsCombinatorial optimisation
Compact formulations
Computational experiments
Cutting stock
Integer programming
Integrated optimisation
Pseudo-poynomial formulations
Valid inequalities
Issue date2016
PublisherInderscience Enterprises Ltd.
JournalInternational Journal of Innovative Computing and Applications
Abstract(s)The efficient solution of practical problems combining both cutting stock and scheduling aspects has motivated the development of several approaches described recently in the literature. These problems consist in determining a cutting plan that minimises both the waste generated by cutting the stock rolls and the tardiness related to the delivery of items later than their specified due date. In this paper, we review two exact formulations proposed recently, which differ essentially on their strength and size. The first one is a compact model, which can be strengthened using knapsack-based inequalities. The other is a pseudo-polynomial model based on arc flows. Additionally, we explore a matheuristic approach based on a variant of the arc flow model that proved to be effective for solving medium scale instances. Computational results are provided and discussed at the end of the paper.
AccessRestricted access (Author)
Appears in Collections:CAlg - Artigos em revistas internacionais/Papers in international journals

Files in This Item:
File Description SizeFormat 
Combined cutting stock and scheduling.pdf
  Restricted access
280,46 kBAdobe PDFView/Open    Request a copy!

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