A dynamic programming approach for batch sizing in a multi-stage production process with random yields

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper proposes a dynamic programming approach to modeling and determining batch sizes in a single period, multi-stage production process with random yields for each stage. To improve the computational performance of the proposed approach, a statistical bound is developed. A key decision incorporated into the model is whether to continue onto the next stage of processing or to scrap the entire current batch of product. This decision is based on the expected total profit from the remaining items for processing following the removal of all defectives. The decisions involving the locations of test stations after stages are also incorporated into the modeling approach.

Original languageEnglish (US)
Pages (from-to)1399-1406
Number of pages8
JournalApplied Mathematics and Computation
Volume218
Issue number4
DOIs
StatePublished - Oct 15 2011

Fingerprint

Dynamic programming
Batch
Dynamic Programming
Processing
Profitability
Modeling
Profit
Continue
Entire
Model

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Cite this

@article{9be6551346a94c03a217367b5ef3bf68,
title = "A dynamic programming approach for batch sizing in a multi-stage production process with random yields",
abstract = "This paper proposes a dynamic programming approach to modeling and determining batch sizes in a single period, multi-stage production process with random yields for each stage. To improve the computational performance of the proposed approach, a statistical bound is developed. A key decision incorporated into the model is whether to continue onto the next stage of processing or to scrap the entire current batch of product. This decision is based on the expected total profit from the remaining items for processing following the removal of all defectives. The decisions involving the locations of test stations after stages are also incorporated into the modeling approach.",
author = "Abdullah Konak and Bartolacci, {Michael R.} and Bezalel Gavish",
year = "2011",
month = "10",
day = "15",
doi = "10.1016/j.amc.2011.06.022",
language = "English (US)",
volume = "218",
pages = "1399--1406",
journal = "Applied Mathematics and Computation",
issn = "0096-3003",
publisher = "Elsevier Inc.",
number = "4",

}

A dynamic programming approach for batch sizing in a multi-stage production process with random yields. / Konak, Abdullah; Bartolacci, Michael R.; Gavish, Bezalel.

In: Applied Mathematics and Computation, Vol. 218, No. 4, 15.10.2011, p. 1399-1406.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A dynamic programming approach for batch sizing in a multi-stage production process with random yields

AU - Konak, Abdullah

AU - Bartolacci, Michael R.

AU - Gavish, Bezalel

PY - 2011/10/15

Y1 - 2011/10/15

N2 - This paper proposes a dynamic programming approach to modeling and determining batch sizes in a single period, multi-stage production process with random yields for each stage. To improve the computational performance of the proposed approach, a statistical bound is developed. A key decision incorporated into the model is whether to continue onto the next stage of processing or to scrap the entire current batch of product. This decision is based on the expected total profit from the remaining items for processing following the removal of all defectives. The decisions involving the locations of test stations after stages are also incorporated into the modeling approach.

AB - This paper proposes a dynamic programming approach to modeling and determining batch sizes in a single period, multi-stage production process with random yields for each stage. To improve the computational performance of the proposed approach, a statistical bound is developed. A key decision incorporated into the model is whether to continue onto the next stage of processing or to scrap the entire current batch of product. This decision is based on the expected total profit from the remaining items for processing following the removal of all defectives. The decisions involving the locations of test stations after stages are also incorporated into the modeling approach.

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

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

U2 - 10.1016/j.amc.2011.06.022

DO - 10.1016/j.amc.2011.06.022

M3 - Article

AN - SCOPUS:80052260233

VL - 218

SP - 1399

EP - 1406

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 4

ER -