Setup and open-stacks minimization in one-dimensional stock cutting

Gleb Belov, Guntram Scheithauer

Research output: Contribution to journalArticleResearchpeer-review

56 Citations (Scopus)

Abstract

The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria in one- dimensional stock cutting are the number of different cutting patterns (setups) and the maximum number of open stacks during the cutting process. There are applications where the number of stacks is restricted to two. We design a sequential heuristic to minimize material input and show its high effectiveness for this purpose. Then we extend it to restrict the number of open stacks to any given limit. Then, the heuristic is simplified and integrated into a setup-minimization approach in order to combine setup and open-stacks minimization. To get a smaller number of open stacks, we may split up the problem into several parts of smaller sizes. Different solutions are evaluated in relation to the multiple objectives using the Pareto criterion.

Original languageEnglish
Pages (from-to)27-35
Number of pages9
JournalINFORMS Journal on Computing
Volume19
Issue number1
DOIs
Publication statusPublished - 1 Jan 2007

Keywords

  • Branch and bound
  • Cutting
  • Open stacks
  • Sequencing
  • Setup minimization

Cite this

@article{f53acfcfa51d4820a06c1845479e134c,
title = "Setup and open-stacks minimization in one-dimensional stock cutting",
abstract = "The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria in one- dimensional stock cutting are the number of different cutting patterns (setups) and the maximum number of open stacks during the cutting process. There are applications where the number of stacks is restricted to two. We design a sequential heuristic to minimize material input and show its high effectiveness for this purpose. Then we extend it to restrict the number of open stacks to any given limit. Then, the heuristic is simplified and integrated into a setup-minimization approach in order to combine setup and open-stacks minimization. To get a smaller number of open stacks, we may split up the problem into several parts of smaller sizes. Different solutions are evaluated in relation to the multiple objectives using the Pareto criterion.",
keywords = "Branch and bound, Cutting, Open stacks, Sequencing, Setup minimization",
author = "Gleb Belov and Guntram Scheithauer",
year = "2007",
month = "1",
day = "1",
doi = "10.1287/ijoc.1050.0132",
language = "English",
volume = "19",
pages = "27--35",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS",
number = "1",

}

Setup and open-stacks minimization in one-dimensional stock cutting. / Belov, Gleb; Scheithauer, Guntram.

In: INFORMS Journal on Computing, Vol. 19, No. 1, 01.01.2007, p. 27-35.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Setup and open-stacks minimization in one-dimensional stock cutting

AU - Belov, Gleb

AU - Scheithauer, Guntram

PY - 2007/1/1

Y1 - 2007/1/1

N2 - The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria in one- dimensional stock cutting are the number of different cutting patterns (setups) and the maximum number of open stacks during the cutting process. There are applications where the number of stacks is restricted to two. We design a sequential heuristic to minimize material input and show its high effectiveness for this purpose. Then we extend it to restrict the number of open stacks to any given limit. Then, the heuristic is simplified and integrated into a setup-minimization approach in order to combine setup and open-stacks minimization. To get a smaller number of open stacks, we may split up the problem into several parts of smaller sizes. Different solutions are evaluated in relation to the multiple objectives using the Pareto criterion.

AB - The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria in one- dimensional stock cutting are the number of different cutting patterns (setups) and the maximum number of open stacks during the cutting process. There are applications where the number of stacks is restricted to two. We design a sequential heuristic to minimize material input and show its high effectiveness for this purpose. Then we extend it to restrict the number of open stacks to any given limit. Then, the heuristic is simplified and integrated into a setup-minimization approach in order to combine setup and open-stacks minimization. To get a smaller number of open stacks, we may split up the problem into several parts of smaller sizes. Different solutions are evaluated in relation to the multiple objectives using the Pareto criterion.

KW - Branch and bound

KW - Cutting

KW - Open stacks

KW - Sequencing

KW - Setup minimization

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

U2 - 10.1287/ijoc.1050.0132

DO - 10.1287/ijoc.1050.0132

M3 - Article

VL - 19

SP - 27

EP - 35

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 1

ER -