Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

UGC: an algorithm for two-Stage Unconstrained Guillotine Cutting

Article Abstract:

The Unconstrained Guillotine Cutting algorithm for solving the two-stage cutting problem with no upper bounds is introduced. The problem pertains to the maximum cut pieces obtained through cutting a rectangle into smaller pieces of predetermined sizes and lot sizes. The procedure, which is based on the branch and bound technique, has been implemented in Pascal and run on a 486DX microcomputer. The program converges in less than one second for problems involving less than 60 pieces.

Author: Wilt, Ann Van Der
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach

Article Abstract:

The AND/OR graph methodology developed by R. Morabito for solving non-staged and unconstrained guillotine cutting problems is extended to staged and constrained cases. The approach, which represents possible cutting patterns as complete paths in an AND/OR graph, is applicable to cutting and packing problems of different dimensions. This may be seen in its application to several published problems using an implementation written in Turbo-Pascal 5.5 and run on a microcomputer.

Author: Morabito, Reinaldo, Arenales, Marcos N.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Case studies, Graphic methods, Packing for shipment, Packing (Shipments), Algebra

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems

Article Abstract:

A branch and bound method and several heuristic procedures for solving unconstrained two-dimensional non-guillotine cutting problems are presented. The problem, which pertains to the cutting of a rectangular plate into rectangular pieces, is characterized by an AND/OR-graph to facilitate its solution. The latter is obtained via search methods such as backtracking and hillclimbing under the restriction of upper and lower bounds.

Author: Arenales, Marcos, Morabito, Reinaldo
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Algebraic logic

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Operations research, Research, Management science, Cutting, Branch and bound algorithms
Similar abstracts:
  • Abstracts: A heuristic algorithm for the asymmetric capacitated vehicle routing problem. A clustering algorithm for item assignment in a synchronized zone order picking system
  • Abstracts: Time for Hong Kong conciliation: Britain and China should end confrontation in 1995. China's hard line on Hong Kong: even traditional supporters have become critical of Beijing
  • Abstracts: South Korea begins dismantling barriers to foreign role in construction industry. Store collapse in Seoul underscores need for drastic reform of building industry
  • Abstracts: Analysts wait for outcome of revamp before fully endorsing Pacific Dunlop. San Miguel gets lukewarm recommendations from analysts worried about profit slowdown
  • Abstracts: Clothing and footwear in the Netherlands. Clothing and footwear in France. Clothing and footwear in Italy
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.