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

TitleAn exact solution approach for an integrated packing and scheduling problem
Author(s)Braga, Nuno
Alves, Cláudio
KeywordsBin packing
Integer programming
Exact algorithms
Issue date2013
Abstract(s)Cutting stock and bin-packing problems are both well known to be NP-hard problems. An interesting variant of these standard problems is the one that consider due dates. The time periods and the need to determine an order by which the orders should be cut increase the practical complexity of these problems. The objective of these variants is to find a cutting plan that minimizes both the total waste (the number of stock rolls used) and the tardiness of all the orders. In this paper, we address the particular case of the bin-packing problem with due dates. We describe the preliminary version of an integer programming model based on an arc-flow formulation. The solution of this model determines both the cutting plan of the items and the tardiness of the orders, i.e. the difference between the due date and the production time. Preliminary computational results on instances from the literature are presented and discussed at the end of the paper.
TypeConference paper
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings

Files in This Item:
File Description SizeFormat 
  Restricted access
200,8 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