A polynomial time algorithm for solving a quality control station configuration problem

Michal Penn*, Tal Raviv

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations; existing machines and optional quality control stations (QCS). Our aim is to simultaneously decide where and if to install the QCSs along the line and to determine the production rate, so as to maximize the steady state expected net profit per time unit from the system. We use dynamic programming to solve the cost minimization auxiliary problem where the aim is to minimize the time unit production cost for a given production rate. Using the above developed O (N2) dynamic programming algorithm as a subroutine, where N stands for the number of machines in the line, we present an O (N4) algorithm to solve the Profit Maximization QCS Configuration Problem.

Original languageEnglish
Pages (from-to)412-419
Number of pages8
JournalDiscrete Applied Mathematics
Volume156
Issue number4
DOIs
StatePublished - 15 Feb 2008
Externally publishedYes

Keywords

  • Polynomial algorithm
  • Quality control
  • Serial production line

Fingerprint

Dive into the research topics of 'A polynomial time algorithm for solving a quality control station configuration problem'. Together they form a unique fingerprint.

Cite this