A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Glass cutting in a small firm
@@ Property / cites work: Glass cutting in a small firm / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
+Normal rank
@@ Property / cites work @@
+Applications of modern heuristic search methods to pattern sequencing problems
+Normal rank
@@ Property / cites work @@
+Simulated annealing for order spread minimization in sequencing cutting patterns
+Normal rank
@@ Property / cites work @@
+Heuristics for sequencing cutting patterns
@@ Property / cites work: Heuristics for sequencing cutting patterns / rank @@
+Normal rank
@@ Property / cites work @@
+Improved heuristics for sequencing cutting patterns
+Normal rank
@@ Property / cites work @@
+Heuristic and exact methods for the cutting sequencing problem
+Normal rank
@@ Property / cites work @@
+Establishing the optimality of sequencing heuristics for cutting stock problems
+Normal rank
@@ Property / cites work @@
+On a pattern sequencing problem to minimize the maximum number of open stacks
+Normal rank
@@ Property / cites work @@
+Connections between cutting-pattern sequencing, VLSI design, and flexible machines
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0305-0548(03)00189-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2121430424
@@ Property / OpenAlex ID: W2121430424 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1886499