Packing layout added value in sheet metal laser cutting operations considering raw material reuse
Bibliographic record
Abstract
We approach an open dimension problem, in specific, a two-dimensional strip packing problem variation found in sheet metal laser cutting, where rectangular items must be cut from a metal sheet, aiming to increase the packing layout added value. Therefore, this research objective is to analyze the packing layout added value with raw material reuse and practical constraints found in real-life laser cutting operations. The Best Fit Decreasing Height heuristic was modified to reuse raw material and calculate the packing layout added value, being compared with three construction heuristics using a set of literature and generated instances. We show the modified best fit decreasing height heuristic obtained better results when compared to the selected heuristics, with a high sheet metal utilization by the original instance rectangles and efficient raw material reuse. Thus, for sheet metal laser cutting practical operations, the modified best fit decreasing height heuristic is suitable for generating good packing layouts, resulting in industrial benefits including cost savings, increased productivity, greater competitiveness, and sustainability. Approaching raw material reuse increased the packing layout added value in most solutions found, and should be considered in real-life laser cutting operations. However, prioritizing only raw material reuse is not ideal, since a high number of additional rectangles can cause manufacturing wastes including overproduction, stock, and extra processing.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".