2005
DOI: 10.1111/j.1475-3995.2005.00488.x
|View full text |Cite
|
Sign up to set email alerts
|

Checkerboard pattern: proposals for its generation

Abstract: Checkerboard patterns, also known as 1‐group patterns, belong to a special class of 2‐stage guillotine patterns that do not need recuts. Such patterns are easier to cut, hence, they demand less machine time. They are of particular interest in high‐demand settings when the machine is a bottleneck for production. We propose a heuristic and an exact method to determine such patterns. Both are two‐phase methods: in the first phase, good combinations within strips are obtained and, afterwards, a good combination of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Year Published

2007
2007
2019
2019

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 16 publications
(15 reference statements)
0
5
0
1
Order By: Relevance
“…Heuristic solutions can be obtained by approaches focusing on the two-staged case, either free (Lodi and Monaci, 2003;Hifi an M'Hallah, 2005;Macedo et al, 2010;Mrad et al, 2012) or pgroup (Yanasse and Katsurayama, 2005;Yanasse and Morabito, 2006;, and on the three-staged case (Puchinger and Raidl, 2007;Silva et al, 2010;Cui et al, 2015b). Besides these papers, other simplifications have been proposed with the aim of reducing the solution space through the elimination of intricate cutting schemes.…”
Section: Heuristic and Metaheuristic Approachesmentioning
confidence: 99%
“…Heuristic solutions can be obtained by approaches focusing on the two-staged case, either free (Lodi and Monaci, 2003;Hifi an M'Hallah, 2005;Macedo et al, 2010;Mrad et al, 2012) or pgroup (Yanasse and Katsurayama, 2005;Yanasse and Morabito, 2006;, and on the three-staged case (Puchinger and Raidl, 2007;Silva et al, 2010;Cui et al, 2015b). Besides these papers, other simplifications have been proposed with the aim of reducing the solution space through the elimination of intricate cutting schemes.…”
Section: Heuristic and Metaheuristic Approachesmentioning
confidence: 99%
“…For the one-dimensional cutting stock problem, the subproblem is a regular knapsack problem ( Gilmore & Gomory, 1961,1963Martello & Toth, 1990 ). Considering higher dimensions for the subproblems, other solution methods have also been proposed in the literature ( Arenales & Morabito, 1995;Christofides & Whitlock, 1977;Yanasse & Katsurayama, 2005 ).…”
Section: Decision Variablesmentioning
confidence: 99%
“…Solution approaches for two‐stage two‐dimensional cutting stock problems based on two phases are common in the literature, as for example in Farley (), Riehme et al. (), Hifi (), Morabito and Garcia (), and Yanasse and Katsurayama (). For the case in which the set of items has few items of identical size, authors have proposed alternatives for the rounding of relaxed solutions of the simplex method (Wäscher and Gau, ; Poldi and Arenales, ) or greedy heuristics combined with column‐generation procedures (Hinxman, ; Poldi and Arenales, ) that may not work well for two‐stage two‐dimensional bin‐packing problems.…”
Section: Two‐stage Bin‐packing Models Without Leftoversmentioning
confidence: 99%