An algorithm for the 2D guillotine cutting stock problem

Article Abstract:

An 0 (n to the third power) approximation algorithm can be applied to solve a two-dimensional guillotine cutting stock problem. In such problems, the application of edge-to edge guillotine cuts is sought for the extraction of a variety of smaller rectangles from a stock piece. Each rectangle is considered in the algorithm and the most viable guillotine position on the stock piece is identified. A position will only be identified for the nth rectangle if a viable location exists. Computational results are described to establish the algorithm's efficacy.

Paper industries machinery, Machine tools, metal cutting types, Models, Production management, Usage, Algorithms, Cutting, Guillotine, Guillotines

---

A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study

Article Abstract:

Research developing a heuristic based on a genetic algorithm aimed at solving problems of product line design is presented. Particular attention is given to ways of implementing the developed algorithm, including in the case of random populations.

Design and construction, Product lines

---

Similar abstracts:

• Abstracts: An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
• Abstracts: The Emperor's old clothes: a rejoinder. Audience attitudes towards brand (product) placement: Singapore and the United States
• Abstracts: The mass production of ideas, and other impossibilities. Correlation is now causation: optical computing. The fluttering of tiny pixels
• Abstracts: Cities in crisis - is growth the answer? An analysis of the outcome of the first and second rounds of the 'Single Regeneration Budget Challenge Fund.'
• Abstracts: Australia faces widening defense horizons. Japan spirals into insecurity. Military history lesson

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.