Title of article
A polynomial time algorithm for solving a quality control station configuration problem Original Research Article
Author/Authors
Michal Penn، نويسنده , , Tal Raviv، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
412
To page
419
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.
Keywords
Quality control , Polynomial algorithm , Serial production line
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886665
Link To Document