Procedures for solving single-pass strip layout problems

Sanjay Joshi, Moises Sudit

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Strip layout is an important step in the planning of operations using blanking dies. Typically the strip layout problem has been resolved using methods which provide approximate solutions, since it is viewed as a class of general 2-D nesting problem which is NP-Hard. This implies that we need to investigate special cases of the strip layout problem that will permit polynomial running time algorithms, while having some practical application in processes of cutting shapes from sheet stock. In this paper we present an exact procedure with polynomial running time for the single-pass single-row layout problem. This problem tries to layout identical shapes on a strip that will go thorough a single row die only once, such as to maximize the number of parts to be yielded by the strip. The paper investigates this problem for two cases: the case for which the width of the strip is larger than any possible orientation of the part, and the case for which the width of the strip is restricted so that not every orientation is feasible. We also consider the problem of cutting a sheet of metal into strips so as to maximize the sum of the parts yielded by each sheet.

Original languageEnglish (US)
Pages (from-to)27-37
Number of pages11
JournalIIE Transactions (Institute of Industrial Engineers)
Volume26
Issue number1
DOIs
StatePublished - Jan 1994

Fingerprint

Polynomials
Strip metal
Planning

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{e972c07146a04c9f93150cb0e6c37f71,
title = "Procedures for solving single-pass strip layout problems",
abstract = "Strip layout is an important step in the planning of operations using blanking dies. Typically the strip layout problem has been resolved using methods which provide approximate solutions, since it is viewed as a class of general 2-D nesting problem which is NP-Hard. This implies that we need to investigate special cases of the strip layout problem that will permit polynomial running time algorithms, while having some practical application in processes of cutting shapes from sheet stock. In this paper we present an exact procedure with polynomial running time for the single-pass single-row layout problem. This problem tries to layout identical shapes on a strip that will go thorough a single row die only once, such as to maximize the number of parts to be yielded by the strip. The paper investigates this problem for two cases: the case for which the width of the strip is larger than any possible orientation of the part, and the case for which the width of the strip is restricted so that not every orientation is feasible. We also consider the problem of cutting a sheet of metal into strips so as to maximize the sum of the parts yielded by each sheet.",
author = "Sanjay Joshi and Moises Sudit",
year = "1994",
month = "1",
doi = "10.1080/07408179408966582",
language = "English (US)",
volume = "26",
pages = "27--37",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

Procedures for solving single-pass strip layout problems. / Joshi, Sanjay; Sudit, Moises.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 26, No. 1, 01.1994, p. 27-37.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Procedures for solving single-pass strip layout problems

AU - Joshi, Sanjay

AU - Sudit, Moises

PY - 1994/1

Y1 - 1994/1

N2 - Strip layout is an important step in the planning of operations using blanking dies. Typically the strip layout problem has been resolved using methods which provide approximate solutions, since it is viewed as a class of general 2-D nesting problem which is NP-Hard. This implies that we need to investigate special cases of the strip layout problem that will permit polynomial running time algorithms, while having some practical application in processes of cutting shapes from sheet stock. In this paper we present an exact procedure with polynomial running time for the single-pass single-row layout problem. This problem tries to layout identical shapes on a strip that will go thorough a single row die only once, such as to maximize the number of parts to be yielded by the strip. The paper investigates this problem for two cases: the case for which the width of the strip is larger than any possible orientation of the part, and the case for which the width of the strip is restricted so that not every orientation is feasible. We also consider the problem of cutting a sheet of metal into strips so as to maximize the sum of the parts yielded by each sheet.

AB - Strip layout is an important step in the planning of operations using blanking dies. Typically the strip layout problem has been resolved using methods which provide approximate solutions, since it is viewed as a class of general 2-D nesting problem which is NP-Hard. This implies that we need to investigate special cases of the strip layout problem that will permit polynomial running time algorithms, while having some practical application in processes of cutting shapes from sheet stock. In this paper we present an exact procedure with polynomial running time for the single-pass single-row layout problem. This problem tries to layout identical shapes on a strip that will go thorough a single row die only once, such as to maximize the number of parts to be yielded by the strip. The paper investigates this problem for two cases: the case for which the width of the strip is larger than any possible orientation of the part, and the case for which the width of the strip is restricted so that not every orientation is feasible. We also consider the problem of cutting a sheet of metal into strips so as to maximize the sum of the parts yielded by each sheet.

UR - http://www.scopus.com/inward/record.url?scp=0028337935&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028337935&partnerID=8YFLogxK

U2 - 10.1080/07408179408966582

DO - 10.1080/07408179408966582

M3 - Article

AN - SCOPUS:0028337935

VL - 26

SP - 27

EP - 37

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 1

ER -