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

TitleA model-based heuristic for the combined cutting stock and scheduling problem
Author(s)Braga, Nuno
Alves, Cláudio
Macedo, Rita
Valério de Carvalho, José Manuel
KeywordsCutting stock
Integer programming
Issue date2015
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract(s)In this paper, we address a variant of the cutting stock problem that considers the scheduling of the cutting operations over time. The problem combines the standard objective of cutting stock problems, which is the minimization of the raw material usage, together with a scheduling term penalizing tardiness. There is tardiness whenever the last instance of an item is cut after its given due date. This problem has been analyzed recently considering one and two-dimensional items. In this paper, we describe a new pseudo-polynomial network flow model for this combined cutting stock and scheduling problem. A revised version of this model in which consecutive time instants are aggregated is used to define an heuristic solution procedure for the problem. This revised formulation is complemented by a time assignment procedure leading to good feasible solutions for the problem. Computational results on benchmark instances are provided illustrating the potential of the approach.
TypeConference paper
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Livros e capítulos de livros/Books and book chapters

Files in This Item:
File Description SizeFormat 
A model-based heuristic for the combined cssp.pdf
  Restricted access
164,15 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