Referenced Items are not available for this document.
In this paper we consider the two dimensional strip packing problem with guillotine cuts. The problem consists on packing a set of rectangular items on one strip of width W and infinite height. The items packed without overlapping, must be extracted by a series of cuts that go from one edge to the opposite edge (guillotine constraint). For this problem, we give a new lower bound based on decomposing the set of the items in sub-sets. This lower bound is used in a branch and bound algorithm to solve the problem to optimality. Computational results are presented to show the performance of both the lower bound and the exact algorithm
Published in:
Service Systems and Service Management, 2006 International Conference on
(Volume:2
)
Date of Conference: Oct. 2006
- Page(s):
- 940 - 946
- E-ISBN :
- 1-4244-0451-7
- Print ISBN:
- 1-4244-0450-9
- INSPEC Accession Number:
- 9376819
- Conference Location :
- Troyes
- Digital Object Identifier :
- 10.1109/ICSSSM.2006.320758
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
