Selecting ingot sizes for joint production of sheet products

Anantaram Balakrishnan, Srimathy Mohan

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper addresses a tactical planning problem of selecting standard ingot sizes to facilitate joint processing of finished sheets in a make-to-order aluminum sheet manufacturing plant. The facility has traditionally dedicated one ingot to each item ordered but is now considering producing multiple items from each ingot to reduce excess metal and exploit economies of scale in processing costs. The effectiveness of this joint processing strategy depends on the available standard ingot sizes. We develop an integer programming model to decide ingot sizes, given the projected demand and technological/operational constraints on combining orders. The model selects a prespecified number of standard sizes and determines which combinations to use to satisfy the demand for all products. The objective is to minimize the total weight of excess metal. We describe a dual-ascent method to generate lower bounds for the problem and heuristic procedures to identify good solutions. Computational results for test problem instances based upon data from an aluminum sheet manufacturer confirm the effectiveness of the algorithm; on average, the gaps between the upper and lower bounds are about 4%. We also illustrate how the model can be used to perform sensitivity analyses.

Original languageEnglish (US)
Pages (from-to)260-273
Number of pages14
JournalINFORMS Journal on Computing
Volume8
Issue number3
StatePublished - 1996
Externally publishedYes

Fingerprint

Ingots
Aluminum sheet
Processing
Integer programming
Metals
Joint production
Planning
Costs
Lower bounds
Aluminum

Keywords

  • Integer
  • Programming

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Selecting ingot sizes for joint production of sheet products. / Balakrishnan, Anantaram; Mohan, Srimathy.

In: INFORMS Journal on Computing, Vol. 8, No. 3, 1996, p. 260-273.

Research output: Contribution to journalArticle

@article{c5d1cdc1327f479f8615af46efe24b51,
title = "Selecting ingot sizes for joint production of sheet products",
abstract = "This paper addresses a tactical planning problem of selecting standard ingot sizes to facilitate joint processing of finished sheets in a make-to-order aluminum sheet manufacturing plant. The facility has traditionally dedicated one ingot to each item ordered but is now considering producing multiple items from each ingot to reduce excess metal and exploit economies of scale in processing costs. The effectiveness of this joint processing strategy depends on the available standard ingot sizes. We develop an integer programming model to decide ingot sizes, given the projected demand and technological/operational constraints on combining orders. The model selects a prespecified number of standard sizes and determines which combinations to use to satisfy the demand for all products. The objective is to minimize the total weight of excess metal. We describe a dual-ascent method to generate lower bounds for the problem and heuristic procedures to identify good solutions. Computational results for test problem instances based upon data from an aluminum sheet manufacturer confirm the effectiveness of the algorithm; on average, the gaps between the upper and lower bounds are about 4{\%}. We also illustrate how the model can be used to perform sensitivity analyses.",
keywords = "Integer, Programming",
author = "Anantaram Balakrishnan and Srimathy Mohan",
year = "1996",
language = "English (US)",
volume = "8",
pages = "260--273",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

TY - JOUR

T1 - Selecting ingot sizes for joint production of sheet products

AU - Balakrishnan, Anantaram

AU - Mohan, Srimathy

PY - 1996

Y1 - 1996

N2 - This paper addresses a tactical planning problem of selecting standard ingot sizes to facilitate joint processing of finished sheets in a make-to-order aluminum sheet manufacturing plant. The facility has traditionally dedicated one ingot to each item ordered but is now considering producing multiple items from each ingot to reduce excess metal and exploit economies of scale in processing costs. The effectiveness of this joint processing strategy depends on the available standard ingot sizes. We develop an integer programming model to decide ingot sizes, given the projected demand and technological/operational constraints on combining orders. The model selects a prespecified number of standard sizes and determines which combinations to use to satisfy the demand for all products. The objective is to minimize the total weight of excess metal. We describe a dual-ascent method to generate lower bounds for the problem and heuristic procedures to identify good solutions. Computational results for test problem instances based upon data from an aluminum sheet manufacturer confirm the effectiveness of the algorithm; on average, the gaps between the upper and lower bounds are about 4%. We also illustrate how the model can be used to perform sensitivity analyses.

AB - This paper addresses a tactical planning problem of selecting standard ingot sizes to facilitate joint processing of finished sheets in a make-to-order aluminum sheet manufacturing plant. The facility has traditionally dedicated one ingot to each item ordered but is now considering producing multiple items from each ingot to reduce excess metal and exploit economies of scale in processing costs. The effectiveness of this joint processing strategy depends on the available standard ingot sizes. We develop an integer programming model to decide ingot sizes, given the projected demand and technological/operational constraints on combining orders. The model selects a prespecified number of standard sizes and determines which combinations to use to satisfy the demand for all products. The objective is to minimize the total weight of excess metal. We describe a dual-ascent method to generate lower bounds for the problem and heuristic procedures to identify good solutions. Computational results for test problem instances based upon data from an aluminum sheet manufacturer confirm the effectiveness of the algorithm; on average, the gaps between the upper and lower bounds are about 4%. We also illustrate how the model can be used to perform sensitivity analyses.

KW - Integer

KW - Programming

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

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

M3 - Article

AN - SCOPUS:20544444887

VL - 8

SP - 260

EP - 273

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 3

ER -