Opening book details…
Can I read Strip Generation Algorithms for Constrained Two-dimensional Two-staged Cutting Problems on EtoBox?
Strip Generation Algorithms for Constrained Two-dimensional Two-staged Cutting Problems by Mhand Hifi; Rym M’Hallah is a Engineering article available to read on EtoBox.
What is Strip Generation Algorithms for Constrained Two-dimensional Two-staged Cutting Problems about?
The constrained two-dimensional cutting (C\_TDC) problem consists of determining a cutting pattern of a set of n small rectangular piece types on a rectangular stock plate of length L and width W, as to maximize the sum of the profits of the pieces to be cut. Each piece type i, i = 1, . . ., n, is characterized by a length l i , a width w i , a profit (or weight) c i and an upper demand value b i . The upper demand value is the maximum number of pieces of type i which can be cut on rectangle (L, W). In this paper, we study the two-staged fixed orientation C\_TDC, noted FC\_2TDC. It is a classical variant of the C\_TDC where each piece is produced, in the final cutting pattern, by at most two guillotine cuts, and each piece has a fixed orientation. We solve the FC\_2TDC problem using several approximate algorithms, that are mainly based upon a strip generation procedure. We evaluate the performance of these algorithms on instances extracted from the literature.
Who reads Strip Generation Algorithms for Constrained Two-dimensional Two-staged Cutting Problems?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- Mhand Hifi; Rym M’Hallah
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0377-2217)
- Published
- 2006
- Language
- EN
- Field
- Engineering (Physical Sciences)